./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_9.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6c24879c 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_9.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 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 03:30:02,991 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 03:30:02,992 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 03:30:03,029 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 03:30:03,029 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 03:30:03,030 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 03:30:03,032 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 03:30:03,037 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 03:30:03,039 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 03:30:03,041 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 03:30:03,042 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 03:30:03,043 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 03:30:03,044 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 03:30:03,047 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 03:30:03,048 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 03:30:03,048 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 03:30:03,049 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 03:30:03,049 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 03:30:03,050 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 03:30:03,051 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 03:30:03,052 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 03:30:03,053 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 03:30:03,053 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 03:30:03,054 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 03:30:03,055 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 03:30:03,056 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 03:30:03,060 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 03:30:03,061 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 03:30:03,062 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 03:30:03,062 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 03:30:03,063 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 03:30:03,063 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 03:30:03,064 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 03:30:03,065 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 03:30:03,065 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 03:30:03,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 03:30:03,066 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 03:30:03,067 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 03:30:03,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 03:30:03,067 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 03:30:03,068 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 03:30:03,069 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 03:30:03,070 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-13 03:30:03,089 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 03:30:03,089 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 03:30:03,089 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 03:30:03,089 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 03:30:03,090 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 03:30:03,090 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 03:30:03,090 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 03:30:03,090 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 03:30:03,091 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 03:30:03,091 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 03:30:03,091 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 03:30:03,091 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 03:30:03,091 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 03:30:03,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 03:30:03,091 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 03:30:03,091 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 03:30:03,091 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 03:30:03,091 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 03:30:03,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 03:30:03,092 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 03:30:03,092 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 03:30:03,092 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 03:30:03,092 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 03:30:03,092 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 03:30:03,092 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 03:30:03,092 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 03:30:03,092 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 03:30:03,093 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 03:30:03,093 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 03:30:03,093 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 03:30:03,093 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 03:30:03,093 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 03:30:03,093 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 -> 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 [2022-07-13 03:30:03,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 03:30:03,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 03:30:03,307 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 03:30:03,308 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 03:30:03,309 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 03:30:03,310 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_9.c [2022-07-13 03:30:03,377 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bebce7ec/8dceff397b3e4147b52e165e45a3d05c/FLAGdcf31dc82 [2022-07-13 03:30:03,710 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 03:30:03,710 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.c [2022-07-13 03:30:03,717 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bebce7ec/8dceff397b3e4147b52e165e45a3d05c/FLAGdcf31dc82 [2022-07-13 03:30:04,145 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bebce7ec/8dceff397b3e4147b52e165e45a3d05c [2022-07-13 03:30:04,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 03:30:04,148 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 03:30:04,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 03:30:04,171 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 03:30:04,179 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 03:30:04,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:30:04" (1/1) ... [2022-07-13 03:30:04,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f26ef25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:30:04, skipping insertion in model container [2022-07-13 03:30:04,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:30:04" (1/1) ... [2022-07-13 03:30:04,185 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 03:30:04,206 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 03:30:04,331 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.c[3555,3568] [2022-07-13 03:30:04,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:30:04,337 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 03:30:04,350 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.c[3555,3568] [2022-07-13 03:30:04,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:30:04,359 INFO L208 MainTranslator]: Completed translation [2022-07-13 03:30:04,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:30:04 WrapperNode [2022-07-13 03:30:04,360 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 03:30:04,361 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 03:30:04,361 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 03:30:04,361 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 03:30:04,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:30:04" (1/1) ... [2022-07-13 03:30:04,370 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:30:04" (1/1) ... [2022-07-13 03:30:04,383 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 117 [2022-07-13 03:30:04,384 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 03:30:04,385 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 03:30:04,385 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 03:30:04,385 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 03:30:04,390 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:30:04" (1/1) ... [2022-07-13 03:30:04,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:30:04" (1/1) ... [2022-07-13 03:30:04,391 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:30:04" (1/1) ... [2022-07-13 03:30:04,391 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:30:04" (1/1) ... [2022-07-13 03:30:04,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:30:04" (1/1) ... [2022-07-13 03:30:04,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:30:04" (1/1) ... [2022-07-13 03:30:04,397 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:30:04" (1/1) ... [2022-07-13 03:30:04,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 03:30:04,398 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 03:30:04,399 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 03:30:04,399 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 03:30:04,399 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:30:04" (1/1) ... [2022-07-13 03:30:04,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:30:04,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:30:04,422 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) [2022-07-13 03:30:04,427 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 [2022-07-13 03:30:04,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 03:30:04,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 03:30:04,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 03:30:04,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 03:30:04,495 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 03:30:04,496 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 03:30:04,605 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 03:30:04,611 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 03:30:04,611 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 03:30:04,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:30:04 BoogieIcfgContainer [2022-07-13 03:30:04,613 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 03:30:04,623 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 03:30:04,624 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 03:30:04,637 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 03:30:04,638 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:30:04,638 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 03:30:04" (1/3) ... [2022-07-13 03:30:04,639 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75687ea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:30:04, skipping insertion in model container [2022-07-13 03:30:04,639 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:30:04,639 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:30:04" (2/3) ... [2022-07-13 03:30:04,639 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75687ea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:30:04, skipping insertion in model container [2022-07-13 03:30:04,639 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:30:04,639 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:30:04" (3/3) ... [2022-07-13 03:30:04,641 INFO L354 chiAutomizerObserver]: Analyzing ICFG test_locks_9.c [2022-07-13 03:30:04,716 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 03:30:04,716 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 03:30:04,716 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 03:30:04,716 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 03:30:04,716 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 03:30:04,716 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 03:30:04,717 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 03:30:04,717 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 03:30:04,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 36 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 35 states have internal predecessors, (65), 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) [2022-07-13 03:30:04,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2022-07-13 03:30:04,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:30:04,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:30:04,748 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:30:04,748 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:30:04,748 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 03:30:04,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 36 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 35 states have internal predecessors, (65), 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) [2022-07-13 03:30:04,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2022-07-13 03:30:04,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:30:04,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:30:04,755 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:30:04,756 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:30:04,761 INFO L752 eck$LassoCheckResult]: Stem: 18#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; 13#L141-1true [2022-07-13 03:30:04,762 INFO L754 eck$LassoCheckResult]: Loop: 13#L141-1true assume !false;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 35#L40true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; 3#L63true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 20#L63-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 27#L67-1true assume !(0 != main_~p3~0#1); 24#L71-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 28#L75-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 14#L79-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 36#L83-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 9#L87-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4#L91-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 33#L95-1true assume !(0 != main_~p1~0#1); 22#L101-1true assume !(0 != main_~p2~0#1); 10#L106-1true assume !(0 != main_~p3~0#1); 11#L111-1true assume !(0 != main_~p4~0#1); 32#L116-1true assume !(0 != main_~p5~0#1); 5#L121-1true assume !(0 != main_~p6~0#1); 17#L126-1true assume !(0 != main_~p7~0#1); 29#L131-1true assume !(0 != main_~p8~0#1); 19#L136-1true assume !(0 != main_~p9~0#1); 13#L141-1true [2022-07-13 03:30:04,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:04,771 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-13 03:30:04,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:04,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937717009] [2022-07-13 03:30:04,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:04,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:04,836 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:04,866 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:04,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:04,869 INFO L85 PathProgramCache]: Analyzing trace with hash 694706197, now seen corresponding path program 1 times [2022-07-13 03:30:04,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:04,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74641214] [2022-07-13 03:30:04,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:04,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:30:04,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:30:04,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:30:04,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74641214] [2022-07-13 03:30:04,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74641214] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:30:04,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:30:04,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:30:04,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272496869] [2022-07-13 03:30:04,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:30:04,943 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:30:04,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:30:04,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:30:04,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:30:04,973 INFO L87 Difference]: Start difference. First operand has 36 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 35 states have internal predecessors, (65), 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.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:05,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:30:05,012 INFO L93 Difference]: Finished difference Result 69 states and 118 transitions. [2022-07-13 03:30:05,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:30:05,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 118 transitions. [2022-07-13 03:30:05,020 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2022-07-13 03:30:05,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 59 states and 93 transitions. [2022-07-13 03:30:05,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2022-07-13 03:30:05,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2022-07-13 03:30:05,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 93 transitions. [2022-07-13 03:30:05,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:30:05,027 INFO L369 hiAutomatonCegarLoop]: Abstraction has 59 states and 93 transitions. [2022-07-13 03:30:05,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 93 transitions. [2022-07-13 03:30:05,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-07-13 03:30:05,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.576271186440678) internal successors, (93), 58 states have internal predecessors, (93), 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) [2022-07-13 03:30:05,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 93 transitions. [2022-07-13 03:30:05,054 INFO L392 hiAutomatonCegarLoop]: Abstraction has 59 states and 93 transitions. [2022-07-13 03:30:05,054 INFO L374 stractBuchiCegarLoop]: Abstraction has 59 states and 93 transitions. [2022-07-13 03:30:05,054 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 03:30:05,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 93 transitions. [2022-07-13 03:30:05,056 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2022-07-13 03:30:05,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:30:05,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:30:05,057 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:30:05,057 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:30:05,058 INFO L752 eck$LassoCheckResult]: Stem: 138#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 123#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; 124#L141-1 [2022-07-13 03:30:05,058 INFO L754 eck$LassoCheckResult]: Loop: 124#L141-1 assume !false;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 131#L40 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; 158#L63 assume !(0 != main_~p1~0#1); 157#L63-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 146#L67-1 assume !(0 != main_~p3~0#1); 147#L71-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 148#L75-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 132#L79-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 133#L83-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 125#L87-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 116#L91-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 117#L95-1 assume !(0 != main_~p1~0#1); 142#L101-1 assume !(0 != main_~p2~0#1); 126#L106-1 assume !(0 != main_~p3~0#1); 127#L111-1 assume !(0 != main_~p4~0#1); 122#L116-1 assume !(0 != main_~p5~0#1); 118#L121-1 assume !(0 != main_~p6~0#1); 120#L126-1 assume !(0 != main_~p7~0#1); 162#L131-1 assume !(0 != main_~p8~0#1); 139#L136-1 assume !(0 != main_~p9~0#1); 124#L141-1 [2022-07-13 03:30:05,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:05,059 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-13 03:30:05,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:05,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158917973] [2022-07-13 03:30:05,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:05,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:05,066 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:05,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:05,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:05,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1299438509, now seen corresponding path program 1 times [2022-07-13 03:30:05,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:05,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094667037] [2022-07-13 03:30:05,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:05,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:30:05,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:30:05,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:30:05,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094667037] [2022-07-13 03:30:05,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094667037] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:30:05,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:30:05,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:30:05,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100740460] [2022-07-13 03:30:05,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:30:05,096 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:30:05,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:30:05,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:30:05,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:30:05,098 INFO L87 Difference]: Start difference. First operand 59 states and 93 transitions. cyclomatic complexity: 36 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:05,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:30:05,109 INFO L93 Difference]: Finished difference Result 114 states and 178 transitions. [2022-07-13 03:30:05,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:30:05,110 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 178 transitions. [2022-07-13 03:30:05,112 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 112 [2022-07-13 03:30:05,113 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 114 states and 178 transitions. [2022-07-13 03:30:05,113 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 114 [2022-07-13 03:30:05,114 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2022-07-13 03:30:05,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 178 transitions. [2022-07-13 03:30:05,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:30:05,114 INFO L369 hiAutomatonCegarLoop]: Abstraction has 114 states and 178 transitions. [2022-07-13 03:30:05,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 178 transitions. [2022-07-13 03:30:05,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-07-13 03:30:05,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 114 states have (on average 1.5614035087719298) internal successors, (178), 113 states have internal predecessors, (178), 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) [2022-07-13 03:30:05,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 178 transitions. [2022-07-13 03:30:05,120 INFO L392 hiAutomatonCegarLoop]: Abstraction has 114 states and 178 transitions. [2022-07-13 03:30:05,120 INFO L374 stractBuchiCegarLoop]: Abstraction has 114 states and 178 transitions. [2022-07-13 03:30:05,121 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 03:30:05,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 178 transitions. [2022-07-13 03:30:05,122 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 112 [2022-07-13 03:30:05,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:30:05,122 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:30:05,123 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:30:05,123 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:30:05,123 INFO L752 eck$LassoCheckResult]: Stem: 321#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 302#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; 303#L141-1 [2022-07-13 03:30:05,123 INFO L754 eck$LassoCheckResult]: Loop: 303#L141-1 assume !false;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 339#L40 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; 336#L63 assume !(0 != main_~p1~0#1); 337#L63-2 assume !(0 != main_~p2~0#1); 379#L67-1 assume !(0 != main_~p3~0#1); 378#L71-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 377#L75-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 376#L79-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 375#L83-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 374#L87-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 373#L91-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 372#L95-1 assume !(0 != main_~p1~0#1); 371#L101-1 assume !(0 != main_~p2~0#1); 368#L106-1 assume !(0 != main_~p3~0#1); 363#L111-1 assume !(0 != main_~p4~0#1); 360#L116-1 assume !(0 != main_~p5~0#1); 356#L121-1 assume !(0 != main_~p6~0#1); 352#L126-1 assume !(0 != main_~p7~0#1); 348#L131-1 assume !(0 != main_~p8~0#1); 344#L136-1 assume !(0 != main_~p9~0#1); 303#L141-1 [2022-07-13 03:30:05,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:05,124 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-07-13 03:30:05,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:05,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779147614] [2022-07-13 03:30:05,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:05,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:05,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:05,129 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:05,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:05,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:05,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1407180885, now seen corresponding path program 1 times [2022-07-13 03:30:05,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:05,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474955937] [2022-07-13 03:30:05,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:05,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:30:05,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:30:05,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:30:05,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474955937] [2022-07-13 03:30:05,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474955937] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:30:05,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:30:05,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:30:05,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610894174] [2022-07-13 03:30:05,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:30:05,155 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:30:05,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:30:05,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:30:05,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:30:05,156 INFO L87 Difference]: Start difference. First operand 114 states and 178 transitions. cyclomatic complexity: 68 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:05,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:30:05,169 INFO L93 Difference]: Finished difference Result 222 states and 342 transitions. [2022-07-13 03:30:05,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:30:05,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 342 transitions. [2022-07-13 03:30:05,172 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 220 [2022-07-13 03:30:05,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 222 states and 342 transitions. [2022-07-13 03:30:05,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 222 [2022-07-13 03:30:05,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 222 [2022-07-13 03:30:05,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 222 states and 342 transitions. [2022-07-13 03:30:05,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:30:05,175 INFO L369 hiAutomatonCegarLoop]: Abstraction has 222 states and 342 transitions. [2022-07-13 03:30:05,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states and 342 transitions. [2022-07-13 03:30:05,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-07-13 03:30:05,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 222 states have (on average 1.5405405405405406) internal successors, (342), 221 states have internal predecessors, (342), 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) [2022-07-13 03:30:05,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 342 transitions. [2022-07-13 03:30:05,191 INFO L392 hiAutomatonCegarLoop]: Abstraction has 222 states and 342 transitions. [2022-07-13 03:30:05,191 INFO L374 stractBuchiCegarLoop]: Abstraction has 222 states and 342 transitions. [2022-07-13 03:30:05,192 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 03:30:05,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 222 states and 342 transitions. [2022-07-13 03:30:05,208 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 220 [2022-07-13 03:30:05,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:30:05,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:30:05,209 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:30:05,209 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:30:05,209 INFO L752 eck$LassoCheckResult]: Stem: 662#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 644#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; 645#L141-1 [2022-07-13 03:30:05,210 INFO L754 eck$LassoCheckResult]: Loop: 645#L141-1 assume !false;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 709#L40 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; 706#L63 assume !(0 != main_~p1~0#1); 703#L63-2 assume !(0 != main_~p2~0#1); 701#L67-1 assume !(0 != main_~p3~0#1); 698#L71-1 assume !(0 != main_~p4~0#1); 696#L75-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 694#L79-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 692#L83-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 690#L87-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 688#L91-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 685#L95-1 assume !(0 != main_~p1~0#1); 686#L101-1 assume !(0 != main_~p2~0#1); 734#L106-1 assume !(0 != main_~p3~0#1); 729#L111-1 assume !(0 != main_~p4~0#1); 728#L116-1 assume !(0 != main_~p5~0#1); 724#L121-1 assume !(0 != main_~p6~0#1); 720#L126-1 assume !(0 != main_~p7~0#1); 716#L131-1 assume !(0 != main_~p8~0#1); 713#L136-1 assume !(0 != main_~p9~0#1); 645#L141-1 [2022-07-13 03:30:05,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:05,210 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-07-13 03:30:05,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:05,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84420965] [2022-07-13 03:30:05,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:05,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:05,216 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:05,222 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:05,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:05,224 INFO L85 PathProgramCache]: Analyzing trace with hash 127317207, now seen corresponding path program 1 times [2022-07-13 03:30:05,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:05,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856837834] [2022-07-13 03:30:05,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:05,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:30:05,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:30:05,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:30:05,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856837834] [2022-07-13 03:30:05,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856837834] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:30:05,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:30:05,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:30:05,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435745801] [2022-07-13 03:30:05,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:30:05,267 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:30:05,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:30:05,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:30:05,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:30:05,268 INFO L87 Difference]: Start difference. First operand 222 states and 342 transitions. cyclomatic complexity: 128 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:05,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:30:05,297 INFO L93 Difference]: Finished difference Result 434 states and 658 transitions. [2022-07-13 03:30:05,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:30:05,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 434 states and 658 transitions. [2022-07-13 03:30:05,301 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 432 [2022-07-13 03:30:05,303 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 434 states to 434 states and 658 transitions. [2022-07-13 03:30:05,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 434 [2022-07-13 03:30:05,304 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 434 [2022-07-13 03:30:05,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 434 states and 658 transitions. [2022-07-13 03:30:05,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:30:05,308 INFO L369 hiAutomatonCegarLoop]: Abstraction has 434 states and 658 transitions. [2022-07-13 03:30:05,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states and 658 transitions. [2022-07-13 03:30:05,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2022-07-13 03:30:05,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 434 states have (on average 1.5161290322580645) internal successors, (658), 433 states have internal predecessors, (658), 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) [2022-07-13 03:30:05,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 658 transitions. [2022-07-13 03:30:05,324 INFO L392 hiAutomatonCegarLoop]: Abstraction has 434 states and 658 transitions. [2022-07-13 03:30:05,324 INFO L374 stractBuchiCegarLoop]: Abstraction has 434 states and 658 transitions. [2022-07-13 03:30:05,325 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 03:30:05,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 434 states and 658 transitions. [2022-07-13 03:30:05,327 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 432 [2022-07-13 03:30:05,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:30:05,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:30:05,328 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:30:05,329 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:30:05,329 INFO L752 eck$LassoCheckResult]: Stem: 1324#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 1306#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; 1307#L141-1 [2022-07-13 03:30:05,329 INFO L754 eck$LassoCheckResult]: Loop: 1307#L141-1 assume !false;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 1355#L40 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; 1356#L63 assume !(0 != main_~p1~0#1); 1456#L63-2 assume !(0 != main_~p2~0#1); 1455#L67-1 assume !(0 != main_~p3~0#1); 1449#L71-1 assume !(0 != main_~p4~0#1); 1443#L75-1 assume !(0 != main_~p5~0#1); 1439#L79-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1435#L83-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1431#L87-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1427#L91-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1404#L95-1 assume !(0 != main_~p1~0#1); 1405#L101-1 assume !(0 != main_~p2~0#1); 1418#L106-1 assume !(0 != main_~p3~0#1); 1414#L111-1 assume !(0 != main_~p4~0#1); 1411#L116-1 assume !(0 != main_~p5~0#1); 1412#L121-1 assume !(0 != main_~p6~0#1); 1469#L126-1 assume !(0 != main_~p7~0#1); 1379#L131-1 assume !(0 != main_~p8~0#1); 1378#L136-1 assume !(0 != main_~p9~0#1); 1307#L141-1 [2022-07-13 03:30:05,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:05,330 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-07-13 03:30:05,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:05,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573931280] [2022-07-13 03:30:05,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:05,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:05,334 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:05,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:05,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:05,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:05,338 INFO L85 PathProgramCache]: Analyzing trace with hash -883800043, now seen corresponding path program 1 times [2022-07-13 03:30:05,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:05,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933068140] [2022-07-13 03:30:05,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:05,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:30:05,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:30:05,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:30:05,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933068140] [2022-07-13 03:30:05,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933068140] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:30:05,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:30:05,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:30:05,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252556538] [2022-07-13 03:30:05,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:30:05,355 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:30:05,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:30:05,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:30:05,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:30:05,356 INFO L87 Difference]: Start difference. First operand 434 states and 658 transitions. cyclomatic complexity: 240 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:05,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:30:05,373 INFO L93 Difference]: Finished difference Result 850 states and 1266 transitions. [2022-07-13 03:30:05,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:30:05,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 850 states and 1266 transitions. [2022-07-13 03:30:05,407 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 848 [2022-07-13 03:30:05,411 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 850 states to 850 states and 1266 transitions. [2022-07-13 03:30:05,411 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 850 [2022-07-13 03:30:05,412 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 850 [2022-07-13 03:30:05,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 850 states and 1266 transitions. [2022-07-13 03:30:05,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:30:05,414 INFO L369 hiAutomatonCegarLoop]: Abstraction has 850 states and 1266 transitions. [2022-07-13 03:30:05,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states and 1266 transitions. [2022-07-13 03:30:05,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 850. [2022-07-13 03:30:05,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 850 states have (on average 1.4894117647058824) internal successors, (1266), 849 states have internal predecessors, (1266), 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) [2022-07-13 03:30:05,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1266 transitions. [2022-07-13 03:30:05,442 INFO L392 hiAutomatonCegarLoop]: Abstraction has 850 states and 1266 transitions. [2022-07-13 03:30:05,442 INFO L374 stractBuchiCegarLoop]: Abstraction has 850 states and 1266 transitions. [2022-07-13 03:30:05,443 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-13 03:30:05,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 850 states and 1266 transitions. [2022-07-13 03:30:05,447 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 848 [2022-07-13 03:30:05,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:30:05,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:30:05,447 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:30:05,448 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:30:05,448 INFO L752 eck$LassoCheckResult]: Stem: 2614#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 2595#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; 2596#L141-1 [2022-07-13 03:30:05,449 INFO L754 eck$LassoCheckResult]: Loop: 2596#L141-1 assume !false;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 2768#L40 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; 2766#L63 assume !(0 != main_~p1~0#1); 2762#L63-2 assume !(0 != main_~p2~0#1); 2763#L67-1 assume !(0 != main_~p3~0#1); 2746#L71-1 assume !(0 != main_~p4~0#1); 2748#L75-1 assume !(0 != main_~p5~0#1); 2735#L79-1 assume !(0 != main_~p6~0#1); 2736#L83-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2723#L87-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2724#L91-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 2706#L95-1 assume !(0 != main_~p1~0#1); 2707#L101-1 assume !(0 != main_~p2~0#1); 2789#L106-1 assume !(0 != main_~p3~0#1); 2786#L111-1 assume !(0 != main_~p4~0#1); 2784#L116-1 assume !(0 != main_~p5~0#1); 2782#L121-1 assume !(0 != main_~p6~0#1); 2781#L126-1 assume !(0 != main_~p7~0#1); 2777#L131-1 assume !(0 != main_~p8~0#1); 2773#L136-1 assume !(0 != main_~p9~0#1); 2596#L141-1 [2022-07-13 03:30:05,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:05,450 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-07-13 03:30:05,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:05,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240326244] [2022-07-13 03:30:05,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:05,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:05,456 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:05,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:05,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:05,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1470606057, now seen corresponding path program 1 times [2022-07-13 03:30:05,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:05,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802499850] [2022-07-13 03:30:05,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:05,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:30:05,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:30:05,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:30:05,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802499850] [2022-07-13 03:30:05,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802499850] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:30:05,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:30:05,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:30:05,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117996473] [2022-07-13 03:30:05,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:30:05,484 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:30:05,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:30:05,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:30:05,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:30:05,485 INFO L87 Difference]: Start difference. First operand 850 states and 1266 transitions. cyclomatic complexity: 448 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:05,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:30:05,504 INFO L93 Difference]: Finished difference Result 1666 states and 2434 transitions. [2022-07-13 03:30:05,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:30:05,505 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1666 states and 2434 transitions. [2022-07-13 03:30:05,524 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1664 [2022-07-13 03:30:05,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1666 states to 1666 states and 2434 transitions. [2022-07-13 03:30:05,538 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1666 [2022-07-13 03:30:05,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1666 [2022-07-13 03:30:05,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1666 states and 2434 transitions. [2022-07-13 03:30:05,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:30:05,545 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1666 states and 2434 transitions. [2022-07-13 03:30:05,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states and 2434 transitions. [2022-07-13 03:30:05,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1666. [2022-07-13 03:30:05,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1666 states, 1666 states have (on average 1.460984393757503) internal successors, (2434), 1665 states have internal predecessors, (2434), 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) [2022-07-13 03:30:05,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 2434 transitions. [2022-07-13 03:30:05,567 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1666 states and 2434 transitions. [2022-07-13 03:30:05,567 INFO L374 stractBuchiCegarLoop]: Abstraction has 1666 states and 2434 transitions. [2022-07-13 03:30:05,568 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-13 03:30:05,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1666 states and 2434 transitions. [2022-07-13 03:30:05,574 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1664 [2022-07-13 03:30:05,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:30:05,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:30:05,575 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:30:05,575 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:30:05,575 INFO L752 eck$LassoCheckResult]: Stem: 5137#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 5117#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; 5118#L141-1 [2022-07-13 03:30:05,575 INFO L754 eck$LassoCheckResult]: Loop: 5118#L141-1 assume !false;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 5213#L40 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; 5210#L63 assume !(0 != main_~p1~0#1); 5207#L63-2 assume !(0 != main_~p2~0#1); 5204#L67-1 assume !(0 != main_~p3~0#1); 5200#L71-1 assume !(0 != main_~p4~0#1); 5196#L75-1 assume !(0 != main_~p5~0#1); 5192#L79-1 assume !(0 != main_~p6~0#1); 5189#L83-1 assume !(0 != main_~p7~0#1); 5187#L87-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 5185#L91-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 5182#L95-1 assume !(0 != main_~p1~0#1); 5183#L101-1 assume !(0 != main_~p2~0#1); 5240#L106-1 assume !(0 != main_~p3~0#1); 5235#L111-1 assume !(0 != main_~p4~0#1); 5231#L116-1 assume !(0 != main_~p5~0#1); 5227#L121-1 assume !(0 != main_~p6~0#1); 5223#L126-1 assume !(0 != main_~p7~0#1); 5220#L131-1 assume !(0 != main_~p8~0#1); 5217#L136-1 assume !(0 != main_~p9~0#1); 5118#L141-1 [2022-07-13 03:30:05,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:05,580 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2022-07-13 03:30:05,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:05,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831786681] [2022-07-13 03:30:05,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:05,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:05,591 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:05,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:05,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:05,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1212440619, now seen corresponding path program 1 times [2022-07-13 03:30:05,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:05,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066841156] [2022-07-13 03:30:05,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:05,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:30:05,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:30:05,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:30:05,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066841156] [2022-07-13 03:30:05,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066841156] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:30:05,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:30:05,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:30:05,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915828285] [2022-07-13 03:30:05,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:30:05,623 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:30:05,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:30:05,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:30:05,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:30:05,624 INFO L87 Difference]: Start difference. First operand 1666 states and 2434 transitions. cyclomatic complexity: 832 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:05,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:30:05,671 INFO L93 Difference]: Finished difference Result 3266 states and 4674 transitions. [2022-07-13 03:30:05,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:30:05,673 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3266 states and 4674 transitions. [2022-07-13 03:30:05,693 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3264 [2022-07-13 03:30:05,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3266 states to 3266 states and 4674 transitions. [2022-07-13 03:30:05,705 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3266 [2022-07-13 03:30:05,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3266 [2022-07-13 03:30:05,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3266 states and 4674 transitions. [2022-07-13 03:30:05,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:30:05,711 INFO L369 hiAutomatonCegarLoop]: Abstraction has 3266 states and 4674 transitions. [2022-07-13 03:30:05,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states and 4674 transitions. [2022-07-13 03:30:05,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 3266. [2022-07-13 03:30:05,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3266 states, 3266 states have (on average 1.4311083894672383) internal successors, (4674), 3265 states have internal predecessors, (4674), 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) [2022-07-13 03:30:05,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 4674 transitions. [2022-07-13 03:30:05,756 INFO L392 hiAutomatonCegarLoop]: Abstraction has 3266 states and 4674 transitions. [2022-07-13 03:30:05,756 INFO L374 stractBuchiCegarLoop]: Abstraction has 3266 states and 4674 transitions. [2022-07-13 03:30:05,757 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-13 03:30:05,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3266 states and 4674 transitions. [2022-07-13 03:30:05,771 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3264 [2022-07-13 03:30:05,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:30:05,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:30:05,772 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:30:05,772 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:30:05,773 INFO L752 eck$LassoCheckResult]: Stem: 10073#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 10055#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; 10056#L141-1 [2022-07-13 03:30:05,773 INFO L754 eck$LassoCheckResult]: Loop: 10056#L141-1 assume !false;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 10243#L40 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; 10240#L63 assume !(0 != main_~p1~0#1); 10241#L63-2 assume !(0 != main_~p2~0#1); 10224#L67-1 assume !(0 != main_~p3~0#1); 10225#L71-1 assume !(0 != main_~p4~0#1); 10208#L75-1 assume !(0 != main_~p5~0#1); 10210#L79-1 assume !(0 != main_~p6~0#1); 10184#L83-1 assume !(0 != main_~p7~0#1); 10186#L87-1 assume !(0 != main_~p8~0#1); 10164#L91-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 10165#L95-1 assume !(0 != main_~p1~0#1); 10268#L101-1 assume !(0 != main_~p2~0#1); 10267#L106-1 assume !(0 != main_~p3~0#1); 10264#L111-1 assume !(0 != main_~p4~0#1); 10262#L116-1 assume !(0 != main_~p5~0#1); 10258#L121-1 assume !(0 != main_~p6~0#1); 10254#L126-1 assume !(0 != main_~p7~0#1); 10250#L131-1 assume !(0 != main_~p8~0#1); 10247#L136-1 assume !(0 != main_~p9~0#1); 10056#L141-1 [2022-07-13 03:30:05,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:05,774 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2022-07-13 03:30:05,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:05,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000264485] [2022-07-13 03:30:05,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:05,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:05,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:05,781 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:05,789 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:05,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:05,790 INFO L85 PathProgramCache]: Analyzing trace with hash -511376041, now seen corresponding path program 1 times [2022-07-13 03:30:05,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:05,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177036267] [2022-07-13 03:30:05,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:05,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:30:05,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:30:05,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:30:05,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177036267] [2022-07-13 03:30:05,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177036267] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:30:05,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:30:05,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 03:30:05,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777141743] [2022-07-13 03:30:05,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:30:05,867 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:30:05,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:30:05,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:30:05,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:30:05,883 INFO L87 Difference]: Start difference. First operand 3266 states and 4674 transitions. cyclomatic complexity: 1536 Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:05,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:30:05,925 INFO L93 Difference]: Finished difference Result 6402 states and 8962 transitions. [2022-07-13 03:30:05,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:30:05,928 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6402 states and 8962 transitions. [2022-07-13 03:30:05,964 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 6400 [2022-07-13 03:30:05,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6402 states to 6402 states and 8962 transitions. [2022-07-13 03:30:05,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6402 [2022-07-13 03:30:05,988 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6402 [2022-07-13 03:30:05,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6402 states and 8962 transitions. [2022-07-13 03:30:05,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:30:05,994 INFO L369 hiAutomatonCegarLoop]: Abstraction has 6402 states and 8962 transitions. [2022-07-13 03:30:05,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6402 states and 8962 transitions. [2022-07-13 03:30:06,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6402 to 6402. [2022-07-13 03:30:06,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6402 states, 6402 states have (on average 1.3998750390502968) internal successors, (8962), 6401 states have internal predecessors, (8962), 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) [2022-07-13 03:30:06,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6402 states to 6402 states and 8962 transitions. [2022-07-13 03:30:06,088 INFO L392 hiAutomatonCegarLoop]: Abstraction has 6402 states and 8962 transitions. [2022-07-13 03:30:06,088 INFO L374 stractBuchiCegarLoop]: Abstraction has 6402 states and 8962 transitions. [2022-07-13 03:30:06,088 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-13 03:30:06,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6402 states and 8962 transitions. [2022-07-13 03:30:06,103 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 6400 [2022-07-13 03:30:06,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:30:06,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:30:06,105 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:30:06,105 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:30:06,105 INFO L752 eck$LassoCheckResult]: Stem: 19746#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 19729#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; 19730#L141-1 [2022-07-13 03:30:06,105 INFO L754 eck$LassoCheckResult]: Loop: 19730#L141-1 assume !false;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 20273#L40 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; 20270#L63 assume !(0 != main_~p1~0#1); 20271#L63-2 assume !(0 != main_~p2~0#1); 20256#L67-1 assume !(0 != main_~p3~0#1); 20253#L71-1 assume !(0 != main_~p4~0#1); 20247#L75-1 assume !(0 != main_~p5~0#1); 20237#L79-1 assume !(0 != main_~p6~0#1); 20239#L83-1 assume !(0 != main_~p7~0#1); 20298#L87-1 assume !(0 != main_~p8~0#1); 20211#L91-1 assume !(0 != main_~p9~0#1); 20213#L95-1 assume !(0 != main_~p1~0#1); 20272#L101-1 assume !(0 != main_~p2~0#1); 20338#L106-1 assume !(0 != main_~p3~0#1); 20334#L111-1 assume !(0 != main_~p4~0#1); 20331#L116-1 assume !(0 != main_~p5~0#1); 20328#L121-1 assume !(0 != main_~p6~0#1); 20326#L126-1 assume !(0 != main_~p7~0#1); 20324#L131-1 assume !(0 != main_~p8~0#1); 20322#L136-1 assume !(0 != main_~p9~0#1); 19730#L141-1 [2022-07-13 03:30:06,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:06,106 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2022-07-13 03:30:06,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:06,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3898078] [2022-07-13 03:30:06,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:06,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:06,114 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:06,126 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:06,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:06,126 INFO L85 PathProgramCache]: Analyzing trace with hash -904403051, now seen corresponding path program 1 times [2022-07-13 03:30:06,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:06,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834445651] [2022-07-13 03:30:06,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:06,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:06,137 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:06,150 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:06,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:06,153 INFO L85 PathProgramCache]: Analyzing trace with hash 551712343, now seen corresponding path program 1 times [2022-07-13 03:30:06,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:06,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694152799] [2022-07-13 03:30:06,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:06,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:06,159 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:06,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:06,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:06,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.07 03:30:06 BoogieIcfgContainer [2022-07-13 03:30:06,456 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-13 03:30:06,457 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 03:30:06,457 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 03:30:06,457 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 03:30:06,457 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:30:04" (3/4) ... [2022-07-13 03:30:06,459 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-07-13 03:30:06,489 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 03:30:06,489 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 03:30:06,490 INFO L158 Benchmark]: Toolchain (without parser) took 2341.84ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 107.5MB in the beginning and 114.7MB in the end (delta: -7.2MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2022-07-13 03:30:06,490 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 79.7MB. Free memory was 36.8MB in the beginning and 36.7MB in the end (delta: 37.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:30:06,491 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.42ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 115.2MB in the end (delta: -7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 03:30:06,491 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.23ms. Allocated memory is still 142.6MB. Free memory was 115.2MB in the beginning and 113.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:30:06,491 INFO L158 Benchmark]: Boogie Preprocessor took 13.43ms. Allocated memory is still 142.6MB. Free memory was 113.9MB in the beginning and 113.1MB in the end (delta: 812.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 03:30:06,491 INFO L158 Benchmark]: RCFGBuilder took 214.90ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 101.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 03:30:06,492 INFO L158 Benchmark]: BuchiAutomizer took 1832.39ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 101.3MB in the beginning and 116.7MB in the end (delta: -15.4MB). Peak memory consumption was 86.2MB. Max. memory is 16.1GB. [2022-07-13 03:30:06,492 INFO L158 Benchmark]: Witness Printer took 32.83ms. Allocated memory is still 172.0MB. Free memory was 116.7MB in the beginning and 114.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 03:30:06,493 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.14ms. Allocated memory is still 79.7MB. Free memory was 36.8MB in the beginning and 36.7MB in the end (delta: 37.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.42ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 115.2MB in the end (delta: -7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.23ms. Allocated memory is still 142.6MB. Free memory was 115.2MB in the beginning and 113.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 13.43ms. Allocated memory is still 142.6MB. Free memory was 113.9MB in the beginning and 113.1MB in the end (delta: 812.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 214.90ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 101.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 1832.39ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 101.3MB in the beginning and 116.7MB in the end (delta: -15.4MB). Peak memory consumption was 86.2MB. Max. memory is 16.1GB. * Witness Printer took 32.83ms. Allocated memory is still 172.0MB. Free memory was 116.7MB in the beginning and 114.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (8 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.8 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 6402 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.7s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 0.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 8. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 301 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 301 mSDsluCounter, 939 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 356 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 40 IncrementalHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 583 mSDtfsCounter, 40 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI8 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 38]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {lk5=0, p1=0, NULL=0, p9=0, lk9=0, NULL=1, cond=4, p5=0, lk2=0, p4=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1b9cd42f=0, lk6=0, lk1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@11b0a814=0, p3=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3f459ca7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@8afd139=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@710f2471=0, p7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@20f6adb=0, \result=0, lk7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@718c91a9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@ccc0e1b=4, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@f783f40=0, p6=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7dcae72=0, p2=0, lk4=0, lk8=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 38]: 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; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L36] int cond; Loop: [L38] COND TRUE 1 [L39] cond = __VERIFIER_nondet_int() [L40] COND FALSE !(cond == 0) [L43] lk1 = 0 [L45] lk2 = 0 [L47] lk3 = 0 [L49] lk4 = 0 [L51] lk5 = 0 [L53] lk6 = 0 [L55] lk7 = 0 [L57] lk8 = 0 [L59] lk9 = 0 [L63] COND FALSE !(p1 != 0) [L67] COND FALSE !(p2 != 0) [L71] COND FALSE !(p3 != 0) [L75] COND FALSE !(p4 != 0) [L79] COND FALSE !(p5 != 0) [L83] COND FALSE !(p6 != 0) [L87] COND FALSE !(p7 != 0) [L91] COND FALSE !(p8 != 0) [L95] COND FALSE !(p9 != 0) [L101] COND FALSE !(p1 != 0) [L106] COND FALSE !(p2 != 0) [L111] COND FALSE !(p3 != 0) [L116] COND FALSE !(p4 != 0) [L121] COND FALSE !(p5 != 0) [L126] COND FALSE !(p6 != 0) [L131] COND FALSE !(p7 != 0) [L136] COND FALSE !(p8 != 0) [L141] COND FALSE !(p9 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-07-13 03:30:06,527 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)