./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-libowfat/build_fullname_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-libowfat/build_fullname_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d5a9d2464f90cb604e81a75f4f55e926d182d9fa ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:40:38,806 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:40:38,807 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:40:38,821 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:40:38,821 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:40:38,822 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:40:38,824 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:40:38,826 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:40:38,827 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:40:38,828 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:40:38,829 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:40:38,829 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:40:38,830 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:40:38,831 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:40:38,832 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:40:38,833 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:40:38,834 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:40:38,835 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:40:38,838 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:40:38,839 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:40:38,840 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:40:38,842 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:40:38,844 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:40:38,844 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:40:38,845 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:40:38,846 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:40:38,847 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:40:38,848 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:40:38,848 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:40:38,850 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:40:38,850 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:40:38,851 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:40:38,851 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:40:38,851 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:40:38,852 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:40:38,853 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:40:38,853 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:40:38,871 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:40:38,871 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:40:38,873 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:40:38,873 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:40:38,873 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:40:38,873 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:40:38,873 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:40:38,873 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:40:38,874 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:40:38,874 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:40:38,874 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:40:38,874 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:40:38,874 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:40:38,875 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:40:38,875 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:40:38,875 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:40:38,875 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:40:38,875 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:40:38,875 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:40:38,875 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:40:38,876 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:40:38,876 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:40:38,876 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:40:38,876 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:40:38,876 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:40:38,877 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:40:38,877 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:40:38,877 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:40:38,878 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:40:38,878 INFO L133 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d5a9d2464f90cb604e81a75f4f55e926d182d9fa [2019-01-01 21:40:38,932 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:40:38,947 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:40:38,950 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:40:38,952 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:40:38,952 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:40:38,953 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-libowfat/build_fullname_true-termination.c.i [2019-01-01 21:40:39,017 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/810a4a060/1dfca1ddb2dc4d45a9edbd22cadc1b5d/FLAGe7bd0cfce [2019-01-01 21:40:39,645 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:40:39,646 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-libowfat/build_fullname_true-termination.c.i [2019-01-01 21:40:39,673 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/810a4a060/1dfca1ddb2dc4d45a9edbd22cadc1b5d/FLAGe7bd0cfce [2019-01-01 21:40:39,836 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/810a4a060/1dfca1ddb2dc4d45a9edbd22cadc1b5d [2019-01-01 21:40:39,840 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:40:39,842 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:40:39,843 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:40:39,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:40:39,848 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:40:39,849 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:40:39" (1/1) ... [2019-01-01 21:40:39,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@227f8f11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:40:39, skipping insertion in model container [2019-01-01 21:40:39,853 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:40:39" (1/1) ... [2019-01-01 21:40:39,862 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:40:39,911 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:40:40,303 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:40:40,329 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:40:40,510 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:40:40,593 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:40:40,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:40:40 WrapperNode [2019-01-01 21:40:40,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:40:40,595 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:40:40,595 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:40:40,595 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:40:40,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:40:40" (1/1) ... [2019-01-01 21:40:40,634 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:40:40" (1/1) ... [2019-01-01 21:40:40,667 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:40:40,667 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:40:40,667 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:40:40,667 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:40:40,679 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:40:40" (1/1) ... [2019-01-01 21:40:40,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:40:40" (1/1) ... [2019-01-01 21:40:40,684 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:40:40" (1/1) ... [2019-01-01 21:40:40,684 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:40:40" (1/1) ... [2019-01-01 21:40:40,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:40:40" (1/1) ... [2019-01-01 21:40:40,701 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:40:40" (1/1) ... [2019-01-01 21:40:40,704 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:40:40" (1/1) ... [2019-01-01 21:40:40,708 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:40:40,709 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:40:40,709 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:40:40,709 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:40:40,713 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:40:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-01-01 21:40:40,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:40:40,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:40:40,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:40:40,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:40:40,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:40:40,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:40:41,370 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:40:41,370 INFO L280 CfgBuilder]: Removed 15 assue(true) statements. [2019-01-01 21:40:41,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:40:41 BoogieIcfgContainer [2019-01-01 21:40:41,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:40:41,372 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:40:41,372 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:40:41,377 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:40:41,378 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:40:41,378 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:40:39" (1/3) ... [2019-01-01 21:40:41,380 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1db3815a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:40:41, skipping insertion in model container [2019-01-01 21:40:41,380 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:40:41,380 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:40:40" (2/3) ... [2019-01-01 21:40:41,382 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1db3815a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:40:41, skipping insertion in model container [2019-01-01 21:40:41,382 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:40:41,382 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:40:41" (3/3) ... [2019-01-01 21:40:41,385 INFO L375 chiAutomizerObserver]: Analyzing ICFG build_fullname_true-termination.c.i [2019-01-01 21:40:41,448 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:40:41,449 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:40:41,449 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:40:41,449 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:40:41,449 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:40:41,449 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:40:41,450 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:40:41,450 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:40:41,450 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:40:41,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2019-01-01 21:40:41,495 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-01-01 21:40:41,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:40:41,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:40:41,505 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:40:41,505 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:40:41,506 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:40:41,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2019-01-01 21:40:41,509 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-01-01 21:40:41,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:40:41,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:40:41,510 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:40:41,510 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:40:41,521 INFO L794 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 9#L532true assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 20#L534true assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.allocOnStack(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 10#L521true assume build_fullname_#t~short10;call build_fullname_#t~mem9 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 0 == build_fullname_#t~mem9; 13#L521-2true assume build_fullname_#t~short10;havoc build_fullname_#t~mem9;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem8;call write~int(47, build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 1);build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset := build_fullname_~dest~0.base, 1 + build_fullname_~dest~0.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~dest~0.base, 1 + build_fullname_~dest~0.offset;havoc build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset; 14#L523-4true strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~filename.base, build_fullname_~filename.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 24#L508-8true [2019-01-01 21:40:41,522 INFO L796 eck$LassoCheckResult]: Loop: 24#L508-8true strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 7#L508-6true assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 24#L508-8true [2019-01-01 21:40:41,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:41,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1806905919, now seen corresponding path program 1 times [2019-01-01 21:40:41,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:41,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:41,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:41,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:40:41,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:41,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:41,800 INFO L82 PathProgramCache]: Analyzing trace with hash 3590, now seen corresponding path program 1 times [2019-01-01 21:40:41,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:41,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:41,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:41,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:40:41,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:41,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:41,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1269803204, now seen corresponding path program 1 times [2019-01-01 21:40:41,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:41,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:41,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:41,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:40:41,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:41,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:42,302 WARN L181 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-01-01 21:40:44,299 WARN L181 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 189 DAG size of output: 154 [2019-01-01 21:40:44,800 WARN L181 SmtUtils]: Spent 458.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2019-01-01 21:40:44,833 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:40:44,834 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:40:44,834 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:40:44,835 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:40:44,835 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:40:44,835 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:40:44,836 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:40:44,836 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:40:44,836 INFO L131 ssoRankerPreferences]: Filename of dumped script: build_fullname_true-termination.c.i_Iteration1_Lasso [2019-01-01 21:40:44,836 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:40:44,836 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:40:44,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:44,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:44,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:44,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:44,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:44,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:44,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:44,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:44,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:44,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-01-01 21:40:44,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:44,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:44,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:44,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:44,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:44,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:46,185 WARN L181 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 119 [2019-01-01 21:40:46,410 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-01-01 21:40:46,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-01-01 21:40:46,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:46,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:46,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:46,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:46,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:46,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:46,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:46,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:46,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:46,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:46,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:46,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:46,690 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-01-01 21:40:46,948 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-01-01 21:40:47,052 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-01 21:40:49,488 WARN L181 SmtUtils]: Spent 2.36 s on a formula simplification. DAG size of input: 74 DAG size of output: 74 [2019-01-01 21:40:49,733 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-01-01 21:40:49,838 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:40:49,845 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:40:49,848 INFO L122 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-01-01 21:40:49,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:49,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:40:49,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:49,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:49,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:49,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:40:49,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:40:49,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:49,862 INFO L122 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-01-01 21:40:49,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:49,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:40:49,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:49,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:49,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:49,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:40:49,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:40:49,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:49,869 INFO L122 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-01-01 21:40:49,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:49,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:49,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:49,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:49,876 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:40:49,876 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:40:49,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:49,881 INFO L122 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-01-01 21:40:49,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:49,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:40:49,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:49,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:49,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:49,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:40:49,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:40:49,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:49,887 INFO L122 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-01-01 21:40:49,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:49,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:40:49,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:49,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:49,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:49,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:40:49,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:40:49,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:49,893 INFO L122 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-01-01 21:40:49,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:49,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:40:49,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:49,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:49,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:49,897 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:40:49,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:40:49,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:49,900 INFO L122 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-01-01 21:40:49,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:49,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:40:49,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:49,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:49,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:49,904 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:40:49,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:40:49,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:49,906 INFO L122 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-01-01 21:40:49,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:49,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:40:49,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:49,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:49,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:49,910 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:40:49,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:40:49,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:49,913 INFO L122 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-01-01 21:40:49,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:49,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:40:49,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:49,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:49,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:49,915 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:40:49,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:40:49,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:49,919 INFO L122 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-01-01 21:40:49,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:49,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:40:49,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:49,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:49,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:49,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:40:49,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:40:49,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:49,926 INFO L122 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-01-01 21:40:49,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:49,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:40:49,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:49,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:49,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:49,928 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:40:49,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:40:49,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:49,932 INFO L122 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-01-01 21:40:49,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:49,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:40:49,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:49,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:49,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:49,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:40:49,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:40:49,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:49,938 INFO L122 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-01-01 21:40:49,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:49,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:40:49,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:49,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:49,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:49,940 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:40:49,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:40:49,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:49,945 INFO L122 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-01-01 21:40:49,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:49,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:40:49,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:49,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:49,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:49,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:40:49,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:40:49,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:49,950 INFO L122 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-01-01 21:40:49,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:49,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:40:49,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:49,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:49,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:49,954 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:40:49,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:40:49,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:49,956 INFO L122 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-01-01 21:40:49,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:49,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:49,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:49,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:49,962 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:40:49,962 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:40:49,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:49,976 INFO L122 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-01-01 21:40:49,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:49,979 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-01 21:40:49,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:49,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:50,000 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-01 21:40:50,001 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:40:50,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:50,143 INFO L122 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-01-01 21:40:50,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:50,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:50,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:50,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:50,148 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:40:50,148 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:40:50,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:50,154 INFO L122 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-01-01 21:40:50,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:50,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:40:50,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:50,156 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:40:50,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:50,157 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 21:40:50,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:40:50,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:50,162 INFO L122 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-01-01 21:40:50,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:50,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:40:50,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:50,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:50,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:50,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:40:50,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:40:50,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:50,170 INFO L122 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-01-01 21:40:50,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:50,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:50,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:50,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:50,176 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:40:50,177 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:40:50,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:50,188 INFO L122 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-01-01 21:40:50,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:50,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:50,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:50,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:50,192 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:40:50,194 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:40:50,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:50,199 INFO L122 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-01-01 21:40:50,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:50,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:50,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:50,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:50,203 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:40:50,204 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:40:50,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:50,208 INFO L122 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-01-01 21:40:50,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:50,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:40:50,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:50,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:50,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:50,210 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:40:50,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:40:50,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:50,214 INFO L122 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-01-01 21:40:50,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:50,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:50,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:50,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:50,217 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:40:50,220 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:40:50,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:50,226 INFO L122 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-01-01 21:40:50,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:50,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:50,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:50,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:50,238 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:40:50,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:40:50,324 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:40:50,409 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:40:50,409 INFO L444 ModelExtractionUtils]: 73 out of 79 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-01 21:40:50,413 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:40:50,414 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:40:50,415 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:40:50,420 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcpy_~s1.offset, v_rep(select #length ULTIMATE.start_strcpy_~s1.base)_1) = -1*ULTIMATE.start_strcpy_~s1.offset + 1*v_rep(select #length ULTIMATE.start_strcpy_~s1.base)_1 Supporting invariants [] [2019-01-01 21:40:50,707 INFO L297 tatePredicateManager]: 35 out of 35 supporting invariants were superfluous and have been removed [2019-01-01 21:40:50,716 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:40:50,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:40:50,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:40:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:40:50,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:40:50,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:40:50,976 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-01-01 21:40:50,977 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states. Second operand 3 states. [2019-01-01 21:40:51,025 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states.. Second operand 3 states. Result 54 states and 72 transitions. Complement of second has 5 states. [2019-01-01 21:40:51,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:40:51,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:40:51,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2019-01-01 21:40:51,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-01 21:40:51,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:40:51,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-01 21:40:51,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:40:51,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 7 letters. Loop has 4 letters. [2019-01-01 21:40:51,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:40:51,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 72 transitions. [2019-01-01 21:40:51,043 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-01 21:40:51,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 15 states and 18 transitions. [2019-01-01 21:40:51,050 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-01-01 21:40:51,051 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-01 21:40:51,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 18 transitions. [2019-01-01 21:40:51,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:40:51,052 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-01-01 21:40:51,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 18 transitions. [2019-01-01 21:40:51,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-01 21:40:51,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-01 21:40:51,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2019-01-01 21:40:51,085 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-01-01 21:40:51,085 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-01-01 21:40:51,085 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:40:51,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2019-01-01 21:40:51,087 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-01 21:40:51,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:40:51,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:40:51,088 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:40:51,088 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:40:51,089 INFO L794 eck$LassoCheckResult]: Stem: 285#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 282#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 283#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 278#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.allocOnStack(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 279#L521 assume build_fullname_#t~short10;call build_fullname_#t~mem9 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 0 == build_fullname_#t~mem9; 284#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~mem9;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem8;call build_fullname_#t~mem12 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 46 != build_fullname_#t~mem12; 280#L523 assume !build_fullname_#t~short14;call build_fullname_#t~mem13 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 0 != build_fullname_#t~mem13; 281#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~mem13;havoc build_fullname_#t~short14;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 271#L508-3 [2019-01-01 21:40:51,089 INFO L796 eck$LassoCheckResult]: Loop: 271#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 272#L508-1 assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 271#L508-3 [2019-01-01 21:40:51,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:51,090 INFO L82 PathProgramCache]: Analyzing trace with hash 179509076, now seen corresponding path program 1 times [2019-01-01 21:40:51,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:51,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:51,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:51,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:40:51,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:40:51,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:40:51,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:40:51,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 21:40:51,373 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:40:51,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:51,373 INFO L82 PathProgramCache]: Analyzing trace with hash 2150, now seen corresponding path program 1 times [2019-01-01 21:40:51,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:51,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:51,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:51,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:40:51,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:51,532 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-01-01 21:40:51,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:40:51,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:40:51,585 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 5 states. [2019-01-01 21:40:51,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:40:51,731 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-01-01 21:40:51,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 21:40:51,733 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2019-01-01 21:40:51,734 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-01 21:40:51,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 23 transitions. [2019-01-01 21:40:51,736 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-01 21:40:51,736 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-01 21:40:51,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2019-01-01 21:40:51,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:40:51,737 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-01-01 21:40:51,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2019-01-01 21:40:51,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-01-01 21:40:51,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-01 21:40:51,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-01-01 21:40:51,741 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-01-01 21:40:51,741 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-01-01 21:40:51,741 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:40:51,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-01-01 21:40:51,743 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-01 21:40:51,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:40:51,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:40:51,744 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:40:51,744 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:40:51,744 INFO L794 eck$LassoCheckResult]: Stem: 331#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 327#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 328#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 323#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.allocOnStack(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 324#L521 assume !build_fullname_#t~short10; 329#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~mem9;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem8;call build_fullname_#t~mem12 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 46 != build_fullname_#t~mem12; 332#L523 assume !build_fullname_#t~short14;call build_fullname_#t~mem13 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 0 != build_fullname_#t~mem13; 326#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~mem13;havoc build_fullname_#t~short14;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 316#L508-3 [2019-01-01 21:40:51,745 INFO L796 eck$LassoCheckResult]: Loop: 316#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 317#L508-1 assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 316#L508-3 [2019-01-01 21:40:51,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:51,745 INFO L82 PathProgramCache]: Analyzing trace with hash 179568658, now seen corresponding path program 1 times [2019-01-01 21:40:51,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:51,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:51,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:51,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:40:51,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:51,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:51,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:51,778 INFO L82 PathProgramCache]: Analyzing trace with hash 2150, now seen corresponding path program 2 times [2019-01-01 21:40:51,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:51,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:51,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:51,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:40:51,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:51,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:51,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:40:51,790 INFO L82 PathProgramCache]: Analyzing trace with hash 766789687, now seen corresponding path program 1 times [2019-01-01 21:40:51,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:40:51,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:40:51,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:51,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:40:51,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:40:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:40:52,271 WARN L181 SmtUtils]: Spent 440.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-01-01 21:40:52,560 WARN L181 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-01 21:40:53,774 WARN L181 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 184 DAG size of output: 153 [2019-01-01 21:40:54,107 WARN L181 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2019-01-01 21:40:54,113 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:40:54,113 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:40:54,113 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:40:54,113 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:40:54,113 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:40:54,113 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:40:54,115 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:40:54,115 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:40:54,115 INFO L131 ssoRankerPreferences]: Filename of dumped script: build_fullname_true-termination.c.i_Iteration3_Lasso [2019-01-01 21:40:54,115 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:40:54,115 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:40:54,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:54,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:54,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:54,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:54,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:54,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:54,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:54,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:54,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:54,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-01-01 21:40:54,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:54,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:54,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-01-01 21:40:54,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-01-01 21:40:54,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:54,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-01-01 21:40:54,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-01-01 21:40:54,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:54,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:54,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:54,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:55,447 WARN L181 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 126 [2019-01-01 21:40:55,665 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-01-01 21:40:55,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:55,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:55,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:55,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:55,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:55,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:55,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:55,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:55,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:40:56,010 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-01-01 21:40:56,189 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-01-01 21:40:56,516 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-01-01 21:40:58,720 WARN L181 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 74 DAG size of output: 74 [2019-01-01 21:40:58,825 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:40:58,826 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:40:58,826 INFO L122 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-01-01 21:40:58,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:58,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:40:58,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:58,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:58,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:58,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:40:58,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:40:58,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:58,835 INFO L122 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-01-01 21:40:58,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:58,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:40:58,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:58,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:58,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:58,836 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:40:58,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:40:58,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:58,840 INFO L122 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-01-01 21:40:58,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:58,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:58,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:58,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:58,844 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:40:58,845 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:40:58,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:58,848 INFO L122 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-01-01 21:40:58,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:58,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:40:58,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:58,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:58,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:58,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:40:58,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:40:58,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:58,850 INFO L122 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-01-01 21:40:58,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:58,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:40:58,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:58,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:58,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:58,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:40:58,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:40:58,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:58,858 INFO L122 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-01-01 21:40:58,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:58,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:40:58,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:58,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:58,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:58,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:40:58,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:40:58,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:58,867 INFO L122 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-01-01 21:40:58,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:58,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:40:58,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:58,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:58,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:58,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:40:58,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:40:58,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:58,873 INFO L122 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-01-01 21:40:58,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:58,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:40:58,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:58,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:58,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:58,876 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:40:58,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:40:58,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:58,880 INFO L122 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-01-01 21:40:58,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:58,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:40:58,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:58,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:58,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:58,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:40:58,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:40:58,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:58,888 INFO L122 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-01-01 21:40:58,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:58,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:40:58,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:58,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:58,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:58,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:40:58,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:40:58,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:58,894 INFO L122 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-01-01 21:40:58,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:58,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:40:58,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:58,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:58,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:58,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:40:58,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:40:58,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:58,898 INFO L122 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-01-01 21:40:58,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:58,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:40:58,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:58,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:58,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:58,899 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:40:58,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:40:58,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:58,904 INFO L122 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-01-01 21:40:58,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:58,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:40:58,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:58,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:58,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:58,908 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:40:58,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:40:58,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:58,912 INFO L122 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-01-01 21:40:58,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:58,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:40:58,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:58,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:58,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:58,914 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:40:58,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:40:58,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:58,915 INFO L122 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-01-01 21:40:58,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:58,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:40:58,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:58,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:58,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:58,916 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:40:58,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:40:58,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:58,921 INFO L122 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-01-01 21:40:58,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:58,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:40:58,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:58,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:58,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:58,922 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:40:58,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:40:58,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:58,923 INFO L122 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-01-01 21:40:58,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:58,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:40:58,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:58,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:58,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:58,927 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:40:58,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:40:58,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:58,928 INFO L122 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-01-01 21:40:58,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:58,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:40:58,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:58,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:58,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:58,929 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:40:58,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:40:58,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:58,936 INFO L122 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-01-01 21:40:58,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:58,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:58,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:58,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:58,941 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:40:58,941 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:40:58,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:58,947 INFO L122 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-01-01 21:40:58,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:58,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:40:58,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:58,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:58,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:58,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:40:58,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:40:58,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:58,949 INFO L122 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-01-01 21:40:58,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:58,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:58,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:58,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:58,953 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:40:58,953 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:40:58,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:58,958 INFO L122 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-01-01 21:40:58,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:58,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:58,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:58,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:58,963 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:40:58,963 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:40:58,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:58,972 INFO L122 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-01-01 21:40:58,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:58,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:58,973 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:40:58,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:58,979 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-01 21:40:58,979 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-01 21:40:59,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:59,001 INFO L122 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-01-01 21:40:59,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:59,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:59,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:59,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:59,002 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:40:59,002 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:40:59,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:59,008 INFO L122 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-01-01 21:40:59,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:59,008 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 21:40:59,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:59,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:59,009 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 21:40:59,009 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:40:59,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:40:59,017 INFO L122 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-01-01 21:40:59,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:40:59,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:40:59,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:40:59,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:40:59,025 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:40:59,026 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:40:59,066 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:40:59,131 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:40:59,131 INFO L444 ModelExtractionUtils]: 57 out of 61 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:40:59,132 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:40:59,133 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:40:59,133 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:40:59,133 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcpy_~s1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_2) = -1*ULTIMATE.start_strcpy_~s1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_2 Supporting invariants [] [2019-01-01 21:41:00,036 INFO L297 tatePredicateManager]: 33 out of 34 supporting invariants were superfluous and have been removed [2019-01-01 21:41:00,062 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:41:00,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:41:00,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:41:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:41:00,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:41:00,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:41:00,978 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-01-01 21:41:00,978 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-01-01 21:41:01,041 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 24 states and 28 transitions. Complement of second has 5 states. [2019-01-01 21:41:01,045 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-01-01 21:41:01,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:41:01,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-01-01 21:41:01,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 8 letters. Loop has 2 letters. [2019-01-01 21:41:01,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:41:01,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 10 letters. Loop has 2 letters. [2019-01-01 21:41:01,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:41:01,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 8 letters. Loop has 4 letters. [2019-01-01 21:41:01,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:41:01,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2019-01-01 21:41:01,049 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:41:01,052 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 18 states and 21 transitions. [2019-01-01 21:41:01,052 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-01-01 21:41:01,052 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-01-01 21:41:01,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2019-01-01 21:41:01,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:41:01,053 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-01-01 21:41:01,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2019-01-01 21:41:01,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-01 21:41:01,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-01 21:41:01,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-01-01 21:41:01,055 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-01-01 21:41:01,055 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-01-01 21:41:01,056 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:41:01,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2019-01-01 21:41:01,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:41:01,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:41:01,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:41:01,057 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:41:01,057 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:41:01,059 INFO L794 eck$LassoCheckResult]: Stem: 567#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 563#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 564#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 559#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.allocOnStack(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 560#L521 assume !build_fullname_#t~short10; 565#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~mem9;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem8;call build_fullname_#t~mem12 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 46 != build_fullname_#t~mem12; 568#L523 assume !build_fullname_#t~short14;call build_fullname_#t~mem13 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 0 != build_fullname_#t~mem13; 562#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~mem13;havoc build_fullname_#t~short14;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 551#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 552#L508-1 assume !(0 != strcpy_#t~mem4);havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 556#L508-4 strcpy_#res.base, strcpy_#res.offset := strcpy_~res~0.base, strcpy_~res~0.offset; 557#L509 build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset := strcpy_#res.base, strcpy_#res.offset;havoc build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset;strchr_#in~t.base, strchr_#in~t.offset, strchr_#in~c := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 0;havoc strchr_#res.base, strchr_#res.offset;havoc strchr_#t~mem5, strchr_#t~mem6, strchr_#t~pre7.base, strchr_#t~pre7.offset, strchr_~t.base, strchr_~t.offset, strchr_~c, strchr_~ch~0;strchr_~t.base, strchr_~t.offset := strchr_#in~t.base, strchr_#in~t.offset;strchr_~c := strchr_#in~c;havoc strchr_~ch~0;strchr_~ch~0 := (if strchr_~c % 256 <= 127 then strchr_~c % 256 else strchr_~c % 256 - 256); 558#L514-2 [2019-01-01 21:41:01,059 INFO L796 eck$LassoCheckResult]: Loop: 558#L514-2 assume !false;call strchr_#t~mem5 := read~int(strchr_~t.base, strchr_~t.offset, 1); 554#L515 assume !(strchr_#t~mem5 == strchr_~ch~0);havoc strchr_#t~mem5;call strchr_#t~mem6 := read~int(strchr_~t.base, strchr_~t.offset, 1); 555#L515-2 assume !(0 == strchr_#t~mem6);havoc strchr_#t~mem6;strchr_#t~pre7.base, strchr_#t~pre7.offset := strchr_~t.base, 1 + strchr_~t.offset;strchr_~t.base, strchr_~t.offset := strchr_~t.base, 1 + strchr_~t.offset;havoc strchr_#t~pre7.base, strchr_#t~pre7.offset; 558#L514-2 [2019-01-01 21:41:01,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:01,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1849486153, now seen corresponding path program 1 times [2019-01-01 21:41:01,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:01,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:01,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:01,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:41:01,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:41:01,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:41:01,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:41:01,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 21:41:01,214 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:41:01,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:01,215 INFO L82 PathProgramCache]: Analyzing trace with hash 85564, now seen corresponding path program 1 times [2019-01-01 21:41:01,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:01,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:01,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:01,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:41:01,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:01,457 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-01 21:41:01,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 21:41:01,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 21:41:01,476 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 6 states. [2019-01-01 21:41:01,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:41:01,557 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-01-01 21:41:01,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 21:41:01,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2019-01-01 21:41:01,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:41:01,561 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 25 transitions. [2019-01-01 21:41:01,562 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-01 21:41:01,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-01-01 21:41:01,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2019-01-01 21:41:01,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:41:01,563 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-01-01 21:41:01,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2019-01-01 21:41:01,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-01-01 21:41:01,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-01 21:41:01,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-01-01 21:41:01,567 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-01-01 21:41:01,568 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-01-01 21:41:01,570 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:41:01,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 24 transitions. [2019-01-01 21:41:01,571 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:41:01,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:41:01,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:41:01,572 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:41:01,572 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:41:01,572 INFO L794 eck$LassoCheckResult]: Stem: 622#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 617#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 618#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 613#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.allocOnStack(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 614#L521 assume !build_fullname_#t~short10; 619#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~mem9;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem8;call build_fullname_#t~mem12 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 46 != build_fullname_#t~mem12; 624#L523 assume build_fullname_#t~short14; 616#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~mem13;havoc build_fullname_#t~short14;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 623#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 607#L508-1 assume !(0 != strcpy_#t~mem4);havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 610#L508-4 strcpy_#res.base, strcpy_#res.offset := strcpy_~res~0.base, strcpy_~res~0.offset; 611#L509 build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset := strcpy_#res.base, strcpy_#res.offset;havoc build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset;strchr_#in~t.base, strchr_#in~t.offset, strchr_#in~c := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 0;havoc strchr_#res.base, strchr_#res.offset;havoc strchr_#t~mem5, strchr_#t~mem6, strchr_#t~pre7.base, strchr_#t~pre7.offset, strchr_~t.base, strchr_~t.offset, strchr_~c, strchr_~ch~0;strchr_~t.base, strchr_~t.offset := strchr_#in~t.base, strchr_#in~t.offset;strchr_~c := strchr_#in~c;havoc strchr_~ch~0;strchr_~ch~0 := (if strchr_~c % 256 <= 127 then strchr_~c % 256 else strchr_~c % 256 - 256); 612#L514-2 [2019-01-01 21:41:01,572 INFO L796 eck$LassoCheckResult]: Loop: 612#L514-2 assume !false;call strchr_#t~mem5 := read~int(strchr_~t.base, strchr_~t.offset, 1); 608#L515 assume !(strchr_#t~mem5 == strchr_~ch~0);havoc strchr_#t~mem5;call strchr_#t~mem6 := read~int(strchr_~t.base, strchr_~t.offset, 1); 609#L515-2 assume !(0 == strchr_#t~mem6);havoc strchr_#t~mem6;strchr_#t~pre7.base, strchr_#t~pre7.offset := strchr_~t.base, 1 + strchr_~t.offset;strchr_~t.base, strchr_~t.offset := strchr_~t.base, 1 + strchr_~t.offset;havoc strchr_#t~pre7.base, strchr_#t~pre7.offset; 612#L514-2 [2019-01-01 21:41:01,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:01,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1906744455, now seen corresponding path program 1 times [2019-01-01 21:41:01,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:01,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:01,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:01,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:41:01,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:01,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:01,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:01,619 INFO L82 PathProgramCache]: Analyzing trace with hash 85564, now seen corresponding path program 2 times [2019-01-01 21:41:01,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:01,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:01,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:01,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:41:01,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:01,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:01,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1413453764, now seen corresponding path program 1 times [2019-01-01 21:41:01,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:01,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:01,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:01,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:41:01,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:41:01,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:41:01,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:41:01,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 21:41:02,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 21:41:02,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 21:41:02,039 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. cyclomatic complexity: 5 Second operand 7 states. [2019-01-01 21:41:02,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:41:02,138 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2019-01-01 21:41:02,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 21:41:02,140 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 30 transitions. [2019-01-01 21:41:02,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:41:02,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 22 states and 25 transitions. [2019-01-01 21:41:02,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-01 21:41:02,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-01-01 21:41:02,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2019-01-01 21:41:02,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:41:02,143 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-01-01 21:41:02,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2019-01-01 21:41:02,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2019-01-01 21:41:02,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-01 21:41:02,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-01-01 21:41:02,145 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-01-01 21:41:02,145 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-01-01 21:41:02,146 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:41:02,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2019-01-01 21:41:02,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:41:02,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:41:02,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:41:02,148 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:41:02,153 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:41:02,154 INFO L794 eck$LassoCheckResult]: Stem: 685#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 681#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 682#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 677#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.allocOnStack(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 678#L521 assume !build_fullname_#t~short10; 683#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~mem9;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem8;call build_fullname_#t~mem12 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 46 != build_fullname_#t~mem12; 686#L523 assume !build_fullname_#t~short14;call build_fullname_#t~mem13 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 0 != build_fullname_#t~mem13; 680#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~mem13;havoc build_fullname_#t~short14;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 668#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 669#L508-1 assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 670#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 671#L508-1 assume !(0 != strcpy_#t~mem4);havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 674#L508-4 strcpy_#res.base, strcpy_#res.offset := strcpy_~res~0.base, strcpy_~res~0.offset; 675#L509 build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset := strcpy_#res.base, strcpy_#res.offset;havoc build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset;strchr_#in~t.base, strchr_#in~t.offset, strchr_#in~c := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 0;havoc strchr_#res.base, strchr_#res.offset;havoc strchr_#t~mem5, strchr_#t~mem6, strchr_#t~pre7.base, strchr_#t~pre7.offset, strchr_~t.base, strchr_~t.offset, strchr_~c, strchr_~ch~0;strchr_~t.base, strchr_~t.offset := strchr_#in~t.base, strchr_#in~t.offset;strchr_~c := strchr_#in~c;havoc strchr_~ch~0;strchr_~ch~0 := (if strchr_~c % 256 <= 127 then strchr_~c % 256 else strchr_~c % 256 - 256); 676#L514-2 [2019-01-01 21:41:02,154 INFO L796 eck$LassoCheckResult]: Loop: 676#L514-2 assume !false;call strchr_#t~mem5 := read~int(strchr_~t.base, strchr_~t.offset, 1); 672#L515 assume !(strchr_#t~mem5 == strchr_~ch~0);havoc strchr_#t~mem5;call strchr_#t~mem6 := read~int(strchr_~t.base, strchr_~t.offset, 1); 673#L515-2 assume !(0 == strchr_#t~mem6);havoc strchr_#t~mem6;strchr_#t~pre7.base, strchr_#t~pre7.offset := strchr_~t.base, 1 + strchr_~t.offset;strchr_~t.base, strchr_~t.offset := strchr_~t.base, 1 + strchr_~t.offset;havoc strchr_#t~pre7.base, strchr_#t~pre7.offset; 676#L514-2 [2019-01-01 21:41:02,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:02,154 INFO L82 PathProgramCache]: Analyzing trace with hash 761840220, now seen corresponding path program 1 times [2019-01-01 21:41:02,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:02,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:02,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:02,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:41:02,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:41:02,435 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2019-01-01 21:41:02,750 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-01-01 21:41:02,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:41:02,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:41:02,805 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:41:02,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:41:02,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:41:02,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:41:02,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2019-01-01 21:41:02,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-01 21:41:02,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:41:03,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2019-01-01 21:41:03,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2019-01-01 21:41:03,066 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:41:03,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-01-01 21:41:03,096 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 21:41:03,113 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:41:03,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:41:03,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-01 21:41:03,185 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:43, output treesize:27 [2019-01-01 21:41:03,670 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 24 [2019-01-01 21:41:03,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2019-01-01 21:41:03,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2019-01-01 21:41:03,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:41:03,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:41:03,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:41:03,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2019-01-01 21:41:03,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2019-01-01 21:41:03,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-01-01 21:41:03,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:41:03,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:41:03,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:41:03,949 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:4 [2019-01-01 21:41:03,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:41:03,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:41:03,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-01-01 21:41:03,975 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:41:03,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:03,975 INFO L82 PathProgramCache]: Analyzing trace with hash 85564, now seen corresponding path program 3 times [2019-01-01 21:41:03,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:03,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:03,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:03,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:41:03,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:04,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 21:41:04,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-01-01 21:41:04,054 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand 11 states. [2019-01-01 21:41:04,395 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-01 21:41:04,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:41:04,556 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-01-01 21:41:04,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 21:41:04,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 28 transitions. [2019-01-01 21:41:04,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:41:04,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 28 transitions. [2019-01-01 21:41:04,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-01 21:41:04,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-01-01 21:41:04,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 28 transitions. [2019-01-01 21:41:04,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:41:04,560 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-01-01 21:41:04,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 28 transitions. [2019-01-01 21:41:04,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-01-01 21:41:04,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-01 21:41:04,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-01-01 21:41:04,564 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-01-01 21:41:04,564 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-01-01 21:41:04,564 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 21:41:04,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 26 transitions. [2019-01-01 21:41:04,565 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:41:04,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:41:04,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:41:04,566 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:41:04,566 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:41:04,566 INFO L794 eck$LassoCheckResult]: Stem: 789#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 785#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 786#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 781#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.allocOnStack(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 782#L521 assume !build_fullname_#t~short10; 787#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~mem9;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem8;call build_fullname_#t~mem12 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 46 != build_fullname_#t~mem12; 795#L523 assume build_fullname_#t~short14; 784#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~mem13;havoc build_fullname_#t~short14;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 773#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 774#L508-1 assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 790#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 791#L508-1 assume !(0 != strcpy_#t~mem4);havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~mem4;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 778#L508-4 strcpy_#res.base, strcpy_#res.offset := strcpy_~res~0.base, strcpy_~res~0.offset; 779#L509 build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset := strcpy_#res.base, strcpy_#res.offset;havoc build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset;strchr_#in~t.base, strchr_#in~t.offset, strchr_#in~c := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 0;havoc strchr_#res.base, strchr_#res.offset;havoc strchr_#t~mem5, strchr_#t~mem6, strchr_#t~pre7.base, strchr_#t~pre7.offset, strchr_~t.base, strchr_~t.offset, strchr_~c, strchr_~ch~0;strchr_~t.base, strchr_~t.offset := strchr_#in~t.base, strchr_#in~t.offset;strchr_~c := strchr_#in~c;havoc strchr_~ch~0;strchr_~ch~0 := (if strchr_~c % 256 <= 127 then strchr_~c % 256 else strchr_~c % 256 - 256); 780#L514-2 [2019-01-01 21:41:04,566 INFO L796 eck$LassoCheckResult]: Loop: 780#L514-2 assume !false;call strchr_#t~mem5 := read~int(strchr_~t.base, strchr_~t.offset, 1); 776#L515 assume !(strchr_#t~mem5 == strchr_~ch~0);havoc strchr_#t~mem5;call strchr_#t~mem6 := read~int(strchr_~t.base, strchr_~t.offset, 1); 777#L515-2 assume !(0 == strchr_#t~mem6);havoc strchr_#t~mem6;strchr_#t~pre7.base, strchr_#t~pre7.offset := strchr_~t.base, 1 + strchr_~t.offset;strchr_~t.base, strchr_~t.offset := strchr_~t.base, 1 + strchr_~t.offset;havoc strchr_#t~pre7.base, strchr_#t~pre7.offset; 780#L514-2 [2019-01-01 21:41:04,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:04,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1571186846, now seen corresponding path program 1 times [2019-01-01 21:41:04,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:04,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:04,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:04,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:41:04,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:04,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:04,608 INFO L82 PathProgramCache]: Analyzing trace with hash 85564, now seen corresponding path program 4 times [2019-01-01 21:41:04,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:04,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:04,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:04,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:41:04,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:04,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:04,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:04,614 INFO L82 PathProgramCache]: Analyzing trace with hash 673793151, now seen corresponding path program 1 times [2019-01-01 21:41:04,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:04,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:04,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:04,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:41:04,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:04,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:04,917 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-01 21:41:05,106 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-01 21:41:07,177 WARN L181 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 273 DAG size of output: 230 [2019-01-01 21:41:08,953 WARN L181 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 180 DAG size of output: 172 [2019-01-01 21:41:08,957 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:41:08,957 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:41:08,957 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:41:08,957 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:41:08,957 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:41:08,957 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:41:08,957 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:41:08,958 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:41:08,958 INFO L131 ssoRankerPreferences]: Filename of dumped script: build_fullname_true-termination.c.i_Iteration7_Lasso [2019-01-01 21:41:08,958 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:41:08,958 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:41:08,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:08,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:08,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:08,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:08,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:08,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:08,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:08,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:08,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:08,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:10,428 WARN L181 SmtUtils]: Spent 721.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 153 [2019-01-01 21:41:10,605 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-01-01 21:41:10,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:10,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:10,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:10,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:10,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:10,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:10,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:10,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:10,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:10,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:10,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:10,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:10,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:10,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:10,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:10,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:10,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:10,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:10,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:10,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:10,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:10,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:10,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:11,162 WARN L181 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-01-01 21:41:11,405 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-01-01 21:41:11,730 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-01 21:41:12,021 WARN L181 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2019-01-01 21:41:14,692 WARN L181 SmtUtils]: Spent 2.64 s on a formula simplification. DAG size of input: 83 DAG size of output: 83 [2019-01-01 21:41:14,842 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:41:14,842 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:41:14,843 INFO L122 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-01-01 21:41:14,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:14,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:14,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:14,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:14,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:14,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:14,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:14,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:14,850 INFO L122 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-01-01 21:41:14,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:14,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:14,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:14,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:14,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:14,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:14,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:14,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:14,862 INFO L122 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-01-01 21:41:14,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:14,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:14,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:14,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:14,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:14,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:14,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:14,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:14,867 INFO L122 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-01-01 21:41:14,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:14,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:14,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:14,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:14,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:14,872 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:14,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:14,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:14,876 INFO L122 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-01-01 21:41:14,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:14,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:14,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:14,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:14,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:14,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:14,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:14,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:14,881 INFO L122 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-01-01 21:41:14,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:14,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:14,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:14,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:14,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:14,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:14,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:14,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:14,887 INFO L122 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-01-01 21:41:14,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:14,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:14,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:14,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:14,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:14,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:14,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:14,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:14,892 INFO L122 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-01-01 21:41:14,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:14,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:14,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:14,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:14,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:14,893 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:14,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:14,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:14,894 INFO L122 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-01-01 21:41:14,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:14,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:14,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:14,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:14,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:14,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:14,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:14,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:14,896 INFO L122 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-01-01 21:41:14,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:14,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:14,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:14,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:14,898 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:14,898 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:14,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:14,910 INFO L122 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-01-01 21:41:14,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:14,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:14,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:14,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:14,915 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:14,915 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:14,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:14,918 INFO L122 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-01-01 21:41:14,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:14,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:14,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:14,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:14,922 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:14,922 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:14,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:14,934 INFO L122 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-01-01 21:41:14,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:14,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:14,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:14,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:14,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:14,939 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:14,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:14,941 INFO L122 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-01-01 21:41:14,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:14,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:14,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:14,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:14,955 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:14,956 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:15,011 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:41:15,072 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 21:41:15,072 INFO L444 ModelExtractionUtils]: 79 out of 88 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-01-01 21:41:15,073 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:41:15,078 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:41:15,078 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:41:15,078 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strchr_~t.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_3) = -1*ULTIMATE.start_strchr_~t.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_3 Supporting invariants [] [2019-01-01 21:41:15,433 INFO L297 tatePredicateManager]: 53 out of 54 supporting invariants were superfluous and have been removed [2019-01-01 21:41:15,437 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:41:15,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:15,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:41:15,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:41:15,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:41:15,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:41:15,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:41:15,748 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2019-01-01 21:41:15,748 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 5 Second operand 5 states. [2019-01-01 21:41:15,794 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 26 states and 30 transitions. Complement of second has 6 states. [2019-01-01 21:41:15,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:41:15,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:41:15,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-01-01 21:41:15,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-01 21:41:15,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:41:15,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 17 letters. Loop has 3 letters. [2019-01-01 21:41:15,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:41:15,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 14 letters. Loop has 6 letters. [2019-01-01 21:41:15,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:41:15,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 30 transitions. [2019-01-01 21:41:15,801 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:41:15,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2019-01-01 21:41:15,801 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:41:15,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:41:15,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:41:15,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:41:15,802 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:41:15,802 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:41:15,802 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:41:15,802 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 21:41:15,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:41:15,802 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:41:15,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:41:15,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:41:15 BoogieIcfgContainer [2019-01-01 21:41:15,815 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:41:15,816 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:41:15,816 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:41:15,816 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:41:15,817 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:40:41" (3/4) ... [2019-01-01 21:41:15,823 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:41:15,824 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:41:15,825 INFO L168 Benchmark]: Toolchain (without parser) took 35983.53 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 449.3 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -132.7 MB). Peak memory consumption was 316.6 MB. Max. memory is 11.5 GB. [2019-01-01 21:41:15,826 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:41:15,826 INFO L168 Benchmark]: CACSL2BoogieTranslator took 750.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -154.7 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:41:15,827 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.98 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:41:15,828 INFO L168 Benchmark]: Boogie Preprocessor took 41.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:41:15,828 INFO L168 Benchmark]: RCFGBuilder took 662.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-01-01 21:41:15,830 INFO L168 Benchmark]: BuchiAutomizer took 34443.19 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 331.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -16.4 MB). Peak memory consumption was 315.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:41:15,831 INFO L168 Benchmark]: Witness Printer took 7.92 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:41:15,838 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 750.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -154.7 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.98 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 662.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 34443.19 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 331.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -16.4 MB). Peak memory consumption was 315.5 MB. Max. memory is 11.5 GB. * Witness Printer took 7.92 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s1 + unknown-#length-unknown[s1] and consists of 4 locations. One deterministic module has affine ranking function -1 * s1 + unknown-#length-unknown[__builtin_alloca (dir_len+file_len+2)] and consists of 4 locations. One deterministic module has affine ranking function -1 * t + unknown-#length-unknown[__builtin_alloca (dir_len+file_len+2)] and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 34.3s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 31.6s. Construction of modules took 0.4s. Büchi inclusion checks took 2.0s. Highest rank in rank-based complementation 3. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 23 states and ocurred in iteration 6. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 116 SDtfs, 105 SDslu, 171 SDs, 0 SdLazy, 207 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU3 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital508 mio100 ax100 hnf99 lsp98 ukn63 mio100 lsp42 div100 bol100 ite100 ukn100 eq201 hnf88 smp98 dnf470 smp97 tf100 neg97 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 161ms VariablesStem: 19 VariablesLoop: 10 DisjunctsStem: 8 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 20 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...