./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_8.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/locks/test_locks_8.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 37d0ed05d77a0379c9ed98058bf2f327252773ce ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 14:41:13,816 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 14:41:13,817 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 14:41:13,846 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 14:41:13,847 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 14:41:13,851 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 14:41:13,852 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 14:41:13,857 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 14:41:13,859 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 14:41:13,865 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 14:41:13,866 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 14:41:13,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 14:41:13,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 14:41:13,872 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 14:41:13,873 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 14:41:13,875 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 14:41:13,878 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 14:41:13,879 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 14:41:13,880 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 14:41:13,882 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 14:41:13,886 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 14:41:13,887 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 14:41:13,888 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 14:41:13,890 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 14:41:13,894 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 14:41:13,894 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 14:41:13,894 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 14:41:13,896 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 14:41:13,896 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 14:41:13,897 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 14:41:13,898 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 14:41:13,898 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 14:41:13,900 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 14:41:13,900 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 14:41:13,901 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 14:41:13,901 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 14:41:13,902 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 14:41:13,902 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 14:41:13,903 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 14:41:13,904 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 14:41:13,905 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 14:41:13,908 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-27 14:41:13,944 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 14:41:13,944 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 14:41:13,945 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 14:41:13,945 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 14:41:13,947 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 14:41:13,947 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 14:41:13,947 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 14:41:13,947 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 14:41:13,948 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 14:41:13,948 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 14:41:13,948 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 14:41:13,949 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 14:41:13,949 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 14:41:13,949 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 14:41:13,949 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 14:41:13,949 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 14:41:13,950 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 14:41:13,950 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 14:41:13,950 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 14:41:13,958 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 14:41:13,958 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 14:41:13,958 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 14:41:13,959 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 14:41:13,959 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 14:41:13,959 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 14:41:13,959 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 14:41:13,959 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 14:41:13,960 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 14:41:13,960 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 14:41:13,960 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 14:41:13,960 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 14:41:13,961 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 14:41:13,962 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 14:41:13,962 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 37d0ed05d77a0379c9ed98058bf2f327252773ce [2021-08-27 14:41:14,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 14:41:14,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 14:41:14,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 14:41:14,302 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 14:41:14,303 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 14:41:14,304 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_8.c [2021-08-27 14:41:14,371 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0943061fe/12017e20de474c9f93b69e85a83faf79/FLAGe25015712 [2021-08-27 14:41:14,843 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 14:41:14,847 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_8.c [2021-08-27 14:41:14,853 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0943061fe/12017e20de474c9f93b69e85a83faf79/FLAGe25015712 [2021-08-27 14:41:14,872 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0943061fe/12017e20de474c9f93b69e85a83faf79 [2021-08-27 14:41:14,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 14:41:14,876 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 14:41:14,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 14:41:14,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 14:41:14,884 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 14:41:14,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:41:14" (1/1) ... [2021-08-27 14:41:14,886 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f03dedf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:14, skipping insertion in model container [2021-08-27 14:41:14,886 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:41:14" (1/1) ... [2021-08-27 14:41:14,893 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 14:41:14,908 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 14:41:15,010 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_8.c[3218,3231] [2021-08-27 14:41:15,011 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 14:41:15,019 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 14:41:15,050 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_8.c[3218,3231] [2021-08-27 14:41:15,051 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 14:41:15,074 INFO L208 MainTranslator]: Completed translation [2021-08-27 14:41:15,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:15 WrapperNode [2021-08-27 14:41:15,075 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 14:41:15,076 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 14:41:15,076 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 14:41:15,077 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 14:41:15,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:15" (1/1) ... [2021-08-27 14:41:15,089 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:15" (1/1) ... [2021-08-27 14:41:15,105 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 14:41:15,106 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 14:41:15,106 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 14:41:15,106 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 14:41:15,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:15" (1/1) ... [2021-08-27 14:41:15,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:15" (1/1) ... [2021-08-27 14:41:15,114 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:15" (1/1) ... [2021-08-27 14:41:15,115 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:15" (1/1) ... [2021-08-27 14:41:15,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:15" (1/1) ... [2021-08-27 14:41:15,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:15" (1/1) ... [2021-08-27 14:41:15,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:15" (1/1) ... [2021-08-27 14:41:15,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 14:41:15,126 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 14:41:15,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 14:41:15,127 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 14:41:15,128 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:15" (1/1) ... [2021-08-27 14:41:15,133 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:41:15,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:41:15,154 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:41:15,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-08-27 14:41:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 14:41:15,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 14:41:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 14:41:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 14:41:15,554 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 14:41:15,555 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-08-27 14:41:15,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:41:15 BoogieIcfgContainer [2021-08-27 14:41:15,556 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 14:41:15,562 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 14:41:15,563 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 14:41:15,577 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 14:41:15,577 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:41:15,578 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 02:41:14" (1/3) ... [2021-08-27 14:41:15,588 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@648a68f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 02:41:15, skipping insertion in model container [2021-08-27 14:41:15,588 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:41:15,589 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:15" (2/3) ... [2021-08-27 14:41:15,589 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@648a68f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 02:41:15, skipping insertion in model container [2021-08-27 14:41:15,589 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:41:15,589 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:41:15" (3/3) ... [2021-08-27 14:41:15,590 INFO L389 chiAutomizerObserver]: Analyzing ICFG test_locks_8.c [2021-08-27 14:41:15,643 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 14:41:15,643 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 14:41:15,643 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 14:41:15,643 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 14:41:15,644 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 14:41:15,644 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 14:41:15,644 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 14:41:15,644 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 14:41:15,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:15,676 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2021-08-27 14:41:15,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:41:15,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:41:15,681 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:41:15,682 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:41:15,682 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 14:41:15,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:15,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2021-08-27 14:41:15,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:41:15,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:41:15,688 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:41:15,688 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:41:15,695 INFO L791 eck$LassoCheckResult]: Stem: 19#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 8#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;havoc main_~cond~0; 22#L127-1true [2021-08-27 14:41:15,696 INFO L793 eck$LassoCheckResult]: Loop: 22#L127-1true assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 29#L37true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0; 7#L58true assume 0 != main_~p1~0;main_~lk1~0 := 1; 14#L58-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 16#L62-1true assume !(0 != main_~p3~0); 30#L66-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 31#L70-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 33#L74-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 27#L78-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 11#L82-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 9#L86-1true assume !(0 != main_~p1~0); 6#L92-1true assume !(0 != main_~p2~0); 17#L97-1true assume !(0 != main_~p3~0); 24#L102-1true assume !(0 != main_~p4~0); 21#L107-1true assume !(0 != main_~p5~0); 34#L112-1true assume !(0 != main_~p6~0); 32#L117-1true assume !(0 != main_~p7~0); 12#L122-1true assume !(0 != main_~p8~0); 22#L127-1true [2021-08-27 14:41:15,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:15,703 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-27 14:41:15,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:15,711 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869779384] [2021-08-27 14:41:15,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:15,713 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:15,806 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:41:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:15,870 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:41:15,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:15,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1098697512, now seen corresponding path program 1 times [2021-08-27 14:41:15,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:15,876 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335002661] [2021-08-27 14:41:15,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:15,877 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:41:15,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:41:15,980 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:41:15,980 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335002661] [2021-08-27 14:41:15,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335002661] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:41:15,981 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:41:15,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:41:15,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27366557] [2021-08-27 14:41:15,995 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:41:15,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:41:16,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:41:16,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:41:16,018 INFO L87 Difference]: Start difference. First operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:16,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:41:16,064 INFO L93 Difference]: Finished difference Result 63 states and 106 transitions. [2021-08-27 14:41:16,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:41:16,067 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 106 transitions. [2021-08-27 14:41:16,075 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2021-08-27 14:41:16,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 53 states and 83 transitions. [2021-08-27 14:41:16,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2021-08-27 14:41:16,080 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2021-08-27 14:41:16,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 83 transitions. [2021-08-27 14:41:16,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:41:16,081 INFO L681 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2021-08-27 14:41:16,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 83 transitions. [2021-08-27 14:41:16,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-08-27 14:41:16,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.5660377358490567) internal successors, (83), 52 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:16,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 83 transitions. [2021-08-27 14:41:16,108 INFO L704 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2021-08-27 14:41:16,109 INFO L587 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2021-08-27 14:41:16,109 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 14:41:16,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 83 transitions. [2021-08-27 14:41:16,110 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2021-08-27 14:41:16,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:41:16,110 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:41:16,111 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:41:16,111 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:41:16,111 INFO L791 eck$LassoCheckResult]: Stem: 125#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 112#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;havoc main_~cond~0; 113#L127-1 [2021-08-27 14:41:16,111 INFO L793 eck$LassoCheckResult]: Loop: 113#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 140#L37 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0; 138#L58 assume !(0 != main_~p1~0); 139#L58-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 157#L62-1 assume !(0 != main_~p3~0); 156#L66-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 155#L70-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 154#L74-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 153#L78-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 152#L82-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 151#L86-1 assume !(0 != main_~p1~0); 109#L92-1 assume !(0 != main_~p2~0); 108#L97-1 assume !(0 != main_~p3~0); 123#L102-1 assume !(0 != main_~p4~0); 129#L107-1 assume !(0 != main_~p5~0); 143#L112-1 assume !(0 != main_~p6~0); 137#L117-1 assume !(0 != main_~p7~0); 131#L122-1 assume !(0 != main_~p8~0); 113#L127-1 [2021-08-27 14:41:16,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:16,112 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-08-27 14:41:16,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:16,113 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244201458] [2021-08-27 14:41:16,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:16,113 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:16,123 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:41:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:16,134 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:41:16,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:16,135 INFO L82 PathProgramCache]: Analyzing trace with hash 77629158, now seen corresponding path program 1 times [2021-08-27 14:41:16,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:16,135 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056864814] [2021-08-27 14:41:16,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:16,136 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:41:16,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:41:16,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:41:16,171 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056864814] [2021-08-27 14:41:16,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056864814] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:41:16,173 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:41:16,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:41:16,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685209380] [2021-08-27 14:41:16,175 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:41:16,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:41:16,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:41:16,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:41:16,178 INFO L87 Difference]: Start difference. First operand 53 states and 83 transitions. cyclomatic complexity: 32 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:16,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:41:16,218 INFO L93 Difference]: Finished difference Result 102 states and 158 transitions. [2021-08-27 14:41:16,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:41:16,219 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 158 transitions. [2021-08-27 14:41:16,225 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 100 [2021-08-27 14:41:16,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 102 states and 158 transitions. [2021-08-27 14:41:16,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2021-08-27 14:41:16,229 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2021-08-27 14:41:16,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 158 transitions. [2021-08-27 14:41:16,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:41:16,230 INFO L681 BuchiCegarLoop]: Abstraction has 102 states and 158 transitions. [2021-08-27 14:41:16,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 158 transitions. [2021-08-27 14:41:16,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2021-08-27 14:41:16,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 102 states have (on average 1.5490196078431373) internal successors, (158), 101 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:16,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 158 transitions. [2021-08-27 14:41:16,248 INFO L704 BuchiCegarLoop]: Abstraction has 102 states and 158 transitions. [2021-08-27 14:41:16,248 INFO L587 BuchiCegarLoop]: Abstraction has 102 states and 158 transitions. [2021-08-27 14:41:16,248 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 14:41:16,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 158 transitions. [2021-08-27 14:41:16,251 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 100 [2021-08-27 14:41:16,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:41:16,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:41:16,252 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:41:16,253 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:41:16,253 INFO L791 eck$LassoCheckResult]: Stem: 289#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 273#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;havoc main_~cond~0; 274#L127-1 [2021-08-27 14:41:16,253 INFO L793 eck$LassoCheckResult]: Loop: 274#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 325#L37 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0; 323#L58 assume !(0 != main_~p1~0); 320#L58-2 assume !(0 != main_~p2~0); 318#L62-1 assume !(0 != main_~p3~0); 316#L66-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 314#L70-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 312#L74-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 310#L78-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 308#L82-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 306#L86-1 assume !(0 != main_~p1~0); 307#L92-1 assume !(0 != main_~p2~0); 348#L97-1 assume !(0 != main_~p3~0); 345#L102-1 assume !(0 != main_~p4~0); 341#L107-1 assume !(0 != main_~p5~0); 336#L112-1 assume !(0 != main_~p6~0); 333#L117-1 assume !(0 != main_~p7~0); 329#L122-1 assume !(0 != main_~p8~0); 274#L127-1 [2021-08-27 14:41:16,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:16,254 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-08-27 14:41:16,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:16,255 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131745700] [2021-08-27 14:41:16,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:16,256 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:16,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:16,274 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:41:16,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:16,283 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:41:16,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:16,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1202234520, now seen corresponding path program 1 times [2021-08-27 14:41:16,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:16,285 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664334671] [2021-08-27 14:41:16,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:16,285 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:41:16,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:41:16,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:41:16,345 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664334671] [2021-08-27 14:41:16,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664334671] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:41:16,346 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:41:16,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:41:16,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901792491] [2021-08-27 14:41:16,347 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:41:16,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:41:16,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:41:16,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:41:16,348 INFO L87 Difference]: Start difference. First operand 102 states and 158 transitions. cyclomatic complexity: 60 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:16,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:41:16,374 INFO L93 Difference]: Finished difference Result 198 states and 302 transitions. [2021-08-27 14:41:16,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:41:16,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 198 states and 302 transitions. [2021-08-27 14:41:16,377 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 196 [2021-08-27 14:41:16,380 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 198 states to 198 states and 302 transitions. [2021-08-27 14:41:16,381 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 198 [2021-08-27 14:41:16,382 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 198 [2021-08-27 14:41:16,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 198 states and 302 transitions. [2021-08-27 14:41:16,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:41:16,387 INFO L681 BuchiCegarLoop]: Abstraction has 198 states and 302 transitions. [2021-08-27 14:41:16,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states and 302 transitions. [2021-08-27 14:41:16,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-08-27 14:41:16,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 198 states have (on average 1.5252525252525253) internal successors, (302), 197 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:16,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 302 transitions. [2021-08-27 14:41:16,410 INFO L704 BuchiCegarLoop]: Abstraction has 198 states and 302 transitions. [2021-08-27 14:41:16,410 INFO L587 BuchiCegarLoop]: Abstraction has 198 states and 302 transitions. [2021-08-27 14:41:16,410 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 14:41:16,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 198 states and 302 transitions. [2021-08-27 14:41:16,411 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 196 [2021-08-27 14:41:16,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:41:16,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:41:16,412 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:41:16,412 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:41:16,413 INFO L791 eck$LassoCheckResult]: Stem: 597#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 580#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;havoc main_~cond~0; 581#L127-1 [2021-08-27 14:41:16,413 INFO L793 eck$LassoCheckResult]: Loop: 581#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 645#L37 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0; 638#L58 assume !(0 != main_~p1~0); 639#L58-2 assume !(0 != main_~p2~0); 630#L62-1 assume !(0 != main_~p3~0); 631#L66-1 assume !(0 != main_~p4~0); 701#L70-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 700#L74-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 699#L78-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 698#L82-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 697#L86-1 assume !(0 != main_~p1~0); 694#L92-1 assume !(0 != main_~p2~0); 690#L97-1 assume !(0 != main_~p3~0); 688#L102-1 assume !(0 != main_~p4~0); 676#L107-1 assume !(0 != main_~p5~0); 675#L112-1 assume !(0 != main_~p6~0); 655#L117-1 assume !(0 != main_~p7~0); 654#L122-1 assume !(0 != main_~p8~0); 581#L127-1 [2021-08-27 14:41:16,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:16,414 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-08-27 14:41:16,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:16,414 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047531449] [2021-08-27 14:41:16,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:16,415 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:16,436 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:41:16,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:16,453 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:41:16,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:16,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1789040534, now seen corresponding path program 1 times [2021-08-27 14:41:16,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:16,455 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736192984] [2021-08-27 14:41:16,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:16,456 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:41:16,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:41:16,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:41:16,495 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736192984] [2021-08-27 14:41:16,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736192984] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:41:16,495 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:41:16,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:41:16,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506404992] [2021-08-27 14:41:16,496 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:41:16,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:41:16,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:41:16,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:41:16,498 INFO L87 Difference]: Start difference. First operand 198 states and 302 transitions. cyclomatic complexity: 112 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:16,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:41:16,525 INFO L93 Difference]: Finished difference Result 386 states and 578 transitions. [2021-08-27 14:41:16,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:41:16,549 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 386 states and 578 transitions. [2021-08-27 14:41:16,552 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 384 [2021-08-27 14:41:16,554 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 386 states to 386 states and 578 transitions. [2021-08-27 14:41:16,555 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 386 [2021-08-27 14:41:16,555 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 386 [2021-08-27 14:41:16,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 386 states and 578 transitions. [2021-08-27 14:41:16,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:41:16,556 INFO L681 BuchiCegarLoop]: Abstraction has 386 states and 578 transitions. [2021-08-27 14:41:16,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states and 578 transitions. [2021-08-27 14:41:16,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2021-08-27 14:41:16,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 386 states have (on average 1.4974093264248705) internal successors, (578), 385 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:16,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 578 transitions. [2021-08-27 14:41:16,567 INFO L704 BuchiCegarLoop]: Abstraction has 386 states and 578 transitions. [2021-08-27 14:41:16,567 INFO L587 BuchiCegarLoop]: Abstraction has 386 states and 578 transitions. [2021-08-27 14:41:16,568 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 14:41:16,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 386 states and 578 transitions. [2021-08-27 14:41:16,570 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 384 [2021-08-27 14:41:16,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:41:16,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:41:16,571 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:41:16,571 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:41:16,571 INFO L791 eck$LassoCheckResult]: Stem: 1186#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1169#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;havoc main_~cond~0; 1170#L127-1 [2021-08-27 14:41:16,571 INFO L793 eck$LassoCheckResult]: Loop: 1170#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 1273#L37 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0; 1266#L58 assume !(0 != main_~p1~0); 1268#L58-2 assume !(0 != main_~p2~0); 1246#L62-1 assume !(0 != main_~p3~0); 1247#L66-1 assume !(0 != main_~p4~0); 1335#L70-1 assume !(0 != main_~p5~0); 1330#L74-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1331#L78-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1322#L82-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1323#L86-1 assume !(0 != main_~p1~0); 1359#L92-1 assume !(0 != main_~p2~0); 1357#L97-1 assume !(0 != main_~p3~0); 1355#L102-1 assume !(0 != main_~p4~0); 1354#L107-1 assume !(0 != main_~p5~0); 1352#L112-1 assume !(0 != main_~p6~0); 1351#L117-1 assume !(0 != main_~p7~0); 1287#L122-1 assume !(0 != main_~p8~0); 1170#L127-1 [2021-08-27 14:41:16,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:16,572 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-08-27 14:41:16,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:16,572 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829812514] [2021-08-27 14:41:16,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:16,573 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:16,579 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:41:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:16,586 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:41:16,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:16,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1530875096, now seen corresponding path program 1 times [2021-08-27 14:41:16,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:16,588 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605469325] [2021-08-27 14:41:16,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:16,588 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:41:16,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:41:16,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:41:16,618 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605469325] [2021-08-27 14:41:16,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605469325] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:41:16,619 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:41:16,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:41:16,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679619347] [2021-08-27 14:41:16,620 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:41:16,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:41:16,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:41:16,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:41:16,622 INFO L87 Difference]: Start difference. First operand 386 states and 578 transitions. cyclomatic complexity: 208 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:16,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:41:16,645 INFO L93 Difference]: Finished difference Result 754 states and 1106 transitions. [2021-08-27 14:41:16,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:41:16,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 754 states and 1106 transitions. [2021-08-27 14:41:16,659 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 752 [2021-08-27 14:41:16,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 754 states to 754 states and 1106 transitions. [2021-08-27 14:41:16,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 754 [2021-08-27 14:41:16,665 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 754 [2021-08-27 14:41:16,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 754 states and 1106 transitions. [2021-08-27 14:41:16,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:41:16,666 INFO L681 BuchiCegarLoop]: Abstraction has 754 states and 1106 transitions. [2021-08-27 14:41:16,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states and 1106 transitions. [2021-08-27 14:41:16,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2021-08-27 14:41:16,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 754 states have (on average 1.46684350132626) internal successors, (1106), 753 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:16,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1106 transitions. [2021-08-27 14:41:16,684 INFO L704 BuchiCegarLoop]: Abstraction has 754 states and 1106 transitions. [2021-08-27 14:41:16,684 INFO L587 BuchiCegarLoop]: Abstraction has 754 states and 1106 transitions. [2021-08-27 14:41:16,684 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-27 14:41:16,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 754 states and 1106 transitions. [2021-08-27 14:41:16,688 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 752 [2021-08-27 14:41:16,688 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:41:16,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:41:16,689 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:41:16,689 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:41:16,689 INFO L791 eck$LassoCheckResult]: Stem: 2329#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 2315#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;havoc main_~cond~0; 2316#L127-1 [2021-08-27 14:41:16,690 INFO L793 eck$LassoCheckResult]: Loop: 2316#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 2415#L37 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0; 2411#L58 assume !(0 != main_~p1~0); 2408#L58-2 assume !(0 != main_~p2~0); 2406#L62-1 assume !(0 != main_~p3~0); 2403#L66-1 assume !(0 != main_~p4~0); 2399#L70-1 assume !(0 != main_~p5~0); 2396#L74-1 assume !(0 != main_~p6~0); 2394#L78-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2391#L82-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2387#L86-1 assume !(0 != main_~p1~0); 2385#L92-1 assume !(0 != main_~p2~0); 2381#L97-1 assume !(0 != main_~p3~0); 2378#L102-1 assume !(0 != main_~p4~0); 2379#L107-1 assume !(0 != main_~p5~0); 2426#L112-1 assume !(0 != main_~p6~0); 2423#L117-1 assume !(0 != main_~p7~0); 2420#L122-1 assume !(0 != main_~p8~0); 2316#L127-1 [2021-08-27 14:41:16,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:16,690 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-08-27 14:41:16,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:16,691 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432275013] [2021-08-27 14:41:16,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:16,691 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:16,717 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:41:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:16,734 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:41:16,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:16,737 INFO L82 PathProgramCache]: Analyzing trace with hash -829810518, now seen corresponding path program 1 times [2021-08-27 14:41:16,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:16,737 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380735158] [2021-08-27 14:41:16,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:16,737 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:41:16,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:41:16,777 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:41:16,777 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380735158] [2021-08-27 14:41:16,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380735158] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:41:16,777 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:41:16,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:41:16,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224413658] [2021-08-27 14:41:16,778 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:41:16,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:41:16,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:41:16,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:41:16,779 INFO L87 Difference]: Start difference. First operand 754 states and 1106 transitions. cyclomatic complexity: 384 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:16,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:41:16,804 INFO L93 Difference]: Finished difference Result 1474 states and 2114 transitions. [2021-08-27 14:41:16,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:41:16,805 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1474 states and 2114 transitions. [2021-08-27 14:41:16,819 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1472 [2021-08-27 14:41:16,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1474 states to 1474 states and 2114 transitions. [2021-08-27 14:41:16,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1474 [2021-08-27 14:41:16,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1474 [2021-08-27 14:41:16,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1474 states and 2114 transitions. [2021-08-27 14:41:16,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:41:16,832 INFO L681 BuchiCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2021-08-27 14:41:16,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states and 2114 transitions. [2021-08-27 14:41:16,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1474. [2021-08-27 14:41:16,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1474 states have (on average 1.4341926729986432) internal successors, (2114), 1473 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:16,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2114 transitions. [2021-08-27 14:41:16,870 INFO L704 BuchiCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2021-08-27 14:41:16,870 INFO L587 BuchiCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2021-08-27 14:41:16,870 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-27 14:41:16,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1474 states and 2114 transitions. [2021-08-27 14:41:16,878 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1472 [2021-08-27 14:41:16,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:41:16,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:41:16,879 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:41:16,879 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:41:16,880 INFO L791 eck$LassoCheckResult]: Stem: 4564#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 4550#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;havoc main_~cond~0; 4551#L127-1 [2021-08-27 14:41:16,880 INFO L793 eck$LassoCheckResult]: Loop: 4551#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 4806#L37 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0; 4807#L58 assume !(0 != main_~p1~0); 4818#L58-2 assume !(0 != main_~p2~0); 4816#L62-1 assume !(0 != main_~p3~0); 4812#L66-1 assume !(0 != main_~p4~0); 4809#L70-1 assume !(0 != main_~p5~0); 4770#L74-1 assume !(0 != main_~p6~0); 4767#L78-1 assume !(0 != main_~p7~0); 4765#L82-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 4730#L86-1 assume !(0 != main_~p1~0); 4724#L92-1 assume !(0 != main_~p2~0); 4725#L97-1 assume !(0 != main_~p3~0); 4711#L102-1 assume !(0 != main_~p4~0); 4713#L107-1 assume !(0 != main_~p5~0); 4831#L112-1 assume !(0 != main_~p6~0); 4827#L117-1 assume !(0 != main_~p7~0); 4824#L122-1 assume !(0 != main_~p8~0); 4551#L127-1 [2021-08-27 14:41:16,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:16,881 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-08-27 14:41:16,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:16,881 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048636987] [2021-08-27 14:41:16,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:16,882 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:16,888 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:41:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:16,895 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:41:16,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:16,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1222837528, now seen corresponding path program 1 times [2021-08-27 14:41:16,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:16,896 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874256872] [2021-08-27 14:41:16,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:16,896 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:41:16,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:41:16,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:41:16,913 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874256872] [2021-08-27 14:41:16,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874256872] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:41:16,913 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:41:16,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 14:41:16,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784740591] [2021-08-27 14:41:16,914 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:41:16,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:41:16,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:41:16,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:41:16,915 INFO L87 Difference]: Start difference. First operand 1474 states and 2114 transitions. cyclomatic complexity: 704 Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:16,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:41:16,937 INFO L93 Difference]: Finished difference Result 2882 states and 4034 transitions. [2021-08-27 14:41:16,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:41:16,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2882 states and 4034 transitions. [2021-08-27 14:41:16,961 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 2880 [2021-08-27 14:41:16,978 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2882 states to 2882 states and 4034 transitions. [2021-08-27 14:41:16,978 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2882 [2021-08-27 14:41:16,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2882 [2021-08-27 14:41:16,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2882 states and 4034 transitions. [2021-08-27 14:41:16,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:41:16,984 INFO L681 BuchiCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2021-08-27 14:41:16,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states and 4034 transitions. [2021-08-27 14:41:17,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2882. [2021-08-27 14:41:17,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2882 states, 2882 states have (on average 1.3997224149895906) internal successors, (4034), 2881 states have internal predecessors, (4034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:17,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2882 states and 4034 transitions. [2021-08-27 14:41:17,048 INFO L704 BuchiCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2021-08-27 14:41:17,048 INFO L587 BuchiCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2021-08-27 14:41:17,049 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-27 14:41:17,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2882 states and 4034 transitions. [2021-08-27 14:41:17,061 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 2880 [2021-08-27 14:41:17,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:41:17,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:41:17,062 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:41:17,062 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:41:17,062 INFO L791 eck$LassoCheckResult]: Stem: 8925#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 8910#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;havoc main_~cond~0; 8911#L127-1 [2021-08-27 14:41:17,062 INFO L793 eck$LassoCheckResult]: Loop: 8911#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 9035#L37 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0; 9033#L58 assume !(0 != main_~p1~0); 9027#L58-2 assume !(0 != main_~p2~0); 9029#L62-1 assume !(0 != main_~p3~0); 9017#L66-1 assume !(0 != main_~p4~0); 9019#L70-1 assume !(0 != main_~p5~0); 9005#L74-1 assume !(0 != main_~p6~0); 9007#L78-1 assume !(0 != main_~p7~0); 8993#L82-1 assume !(0 != main_~p8~0); 8995#L86-1 assume !(0 != main_~p1~0); 9058#L92-1 assume !(0 != main_~p2~0); 9056#L97-1 assume !(0 != main_~p3~0); 9053#L102-1 assume !(0 != main_~p4~0); 9051#L107-1 assume !(0 != main_~p5~0); 9047#L112-1 assume !(0 != main_~p6~0); 9043#L117-1 assume !(0 != main_~p7~0); 9039#L122-1 assume !(0 != main_~p8~0); 8911#L127-1 [2021-08-27 14:41:17,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:17,063 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-08-27 14:41:17,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:17,063 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171300343] [2021-08-27 14:41:17,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:17,064 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:17,069 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:41:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:17,092 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:41:17,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:17,093 INFO L82 PathProgramCache]: Analyzing trace with hash -542779158, now seen corresponding path program 1 times [2021-08-27 14:41:17,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:17,094 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773056830] [2021-08-27 14:41:17,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:17,094 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:17,097 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:41:17,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:17,101 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:41:17,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:17,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1175900116, now seen corresponding path program 1 times [2021-08-27 14:41:17,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:17,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789485417] [2021-08-27 14:41:17,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:17,102 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:17,107 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:41:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:17,115 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:41:17,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 02:41:17 BoogieIcfgContainer [2021-08-27 14:41:17,626 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 14:41:17,626 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 14:41:17,626 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 14:41:17,627 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 14:41:17,627 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:41:15" (3/4) ... [2021-08-27 14:41:17,629 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-08-27 14:41:17,662 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 14:41:17,662 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 14:41:17,663 INFO L168 Benchmark]: Toolchain (without parser) took 2786.86 ms. Allocated memory was 56.6 MB in the beginning and 140.5 MB in the end (delta: 83.9 MB). Free memory was 35.6 MB in the beginning and 98.2 MB in the end (delta: -62.6 MB). Peak memory consumption was 19.8 MB. Max. memory is 16.1 GB. [2021-08-27 14:41:17,664 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 56.6 MB. Free memory was 38.7 MB in the beginning and 38.6 MB in the end (delta: 73.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 14:41:17,664 INFO L168 Benchmark]: CACSL2BoogieTranslator took 194.56 ms. Allocated memory is still 56.6 MB. Free memory was 35.4 MB in the beginning and 39.5 MB in the end (delta: -4.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 14:41:17,664 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.81 ms. Allocated memory is still 56.6 MB. Free memory was 39.5 MB in the beginning and 38.0 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 14:41:17,665 INFO L168 Benchmark]: Boogie Preprocessor took 20.10 ms. Allocated memory is still 56.6 MB. Free memory was 38.0 MB in the beginning and 36.8 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 14:41:17,665 INFO L168 Benchmark]: RCFGBuilder took 430.01 ms. Allocated memory was 56.6 MB in the beginning and 73.4 MB in the end (delta: 16.8 MB). Free memory was 36.6 MB in the beginning and 49.1 MB in the end (delta: -12.5 MB). Peak memory consumption was 14.0 MB. Max. memory is 16.1 GB. [2021-08-27 14:41:17,666 INFO L168 Benchmark]: BuchiAutomizer took 2063.82 ms. Allocated memory was 73.4 MB in the beginning and 140.5 MB in the end (delta: 67.1 MB). Free memory was 49.1 MB in the beginning and 100.2 MB in the end (delta: -51.2 MB). Peak memory consumption was 49.6 MB. Max. memory is 16.1 GB. [2021-08-27 14:41:17,666 INFO L168 Benchmark]: Witness Printer took 35.78 ms. Allocated memory is still 140.5 MB. Free memory was 100.2 MB in the beginning and 98.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 14:41:17,668 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 56.6 MB. Free memory was 38.7 MB in the beginning and 38.6 MB in the end (delta: 73.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 194.56 ms. Allocated memory is still 56.6 MB. Free memory was 35.4 MB in the beginning and 39.5 MB in the end (delta: -4.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 28.81 ms. Allocated memory is still 56.6 MB. Free memory was 39.5 MB in the beginning and 38.0 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 20.10 ms. Allocated memory is still 56.6 MB. Free memory was 38.0 MB in the beginning and 36.8 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 430.01 ms. Allocated memory was 56.6 MB in the beginning and 73.4 MB in the end (delta: 16.8 MB). Free memory was 36.6 MB in the beginning and 49.1 MB in the end (delta: -12.5 MB). Peak memory consumption was 14.0 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 2063.82 ms. Allocated memory was 73.4 MB in the beginning and 140.5 MB in the end (delta: 67.1 MB). Free memory was 49.1 MB in the beginning and 100.2 MB in the end (delta: -51.2 MB). Peak memory consumption was 49.6 MB. Max. memory is 16.1 GB. * Witness Printer took 35.78 ms. Allocated memory is still 140.5 MB. Free memory was 100.2 MB in the beginning and 98.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 2882 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.9s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 184.9ms AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 2882 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 459 SDtfs, 236 SDslu, 277 SDs, 0 SdLazy, 35 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 85.4ms Time LassoAnalysisResults: nont1 unkn0 SFLI7 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 35]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=8573} State at position 1 is {NULL=8574, NULL=0, p1=0, \result=0, p3=0, p2=0, p5=0, NULL=8573, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@37e5e194=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@ec957f9=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@78e4948e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4d67e20=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1ca7d66f=0, cond=10, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@58952c9d=0, NULL=8576, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@40993e5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3399ca3a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@112f6688=10, NULL=0, NULL=0, NULL=0, NULL=8575, lk3=0, lk4=0, lk5=0, lk6=0, NULL=0, lk1=0, lk2=0, lk7=0, lk8=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 35]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L33] int cond; Loop: [L35] COND TRUE 1 [L36] cond = __VERIFIER_nondet_int() [L37] COND FALSE !(cond == 0) [L40] lk1 = 0 [L42] lk2 = 0 [L44] lk3 = 0 [L46] lk4 = 0 [L48] lk5 = 0 [L50] lk6 = 0 [L52] lk7 = 0 [L54] lk8 = 0 [L58] COND FALSE !(p1 != 0) [L62] COND FALSE !(p2 != 0) [L66] COND FALSE !(p3 != 0) [L70] COND FALSE !(p4 != 0) [L74] COND FALSE !(p5 != 0) [L78] COND FALSE !(p6 != 0) [L82] COND FALSE !(p7 != 0) [L86] COND FALSE !(p8 != 0) [L92] COND FALSE !(p1 != 0) [L97] COND FALSE !(p2 != 0) [L102] COND FALSE !(p3 != 0) [L107] COND FALSE !(p4 != 0) [L112] COND FALSE !(p5 != 0) [L117] COND FALSE !(p6 != 0) [L122] COND FALSE !(p7 != 0) [L127] COND FALSE !(p8 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-08-27 14:41:17,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...