./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_6.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 839c364b 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_6.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 c0f4ea6e3bcbb2b79339dce82d9fa934022810e04d651b4bbb6fb3904b8f8c98 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 23:12:17,064 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 23:12:17,091 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 23:12:17,125 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 23:12:17,127 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 23:12:17,130 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 23:12:17,131 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 23:12:17,135 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 23:12:17,137 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 23:12:17,139 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 23:12:17,139 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 23:12:17,140 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 23:12:17,140 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 23:12:17,143 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 23:12:17,145 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 23:12:17,146 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 23:12:17,147 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 23:12:17,148 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 23:12:17,150 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 23:12:17,152 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 23:12:17,155 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 23:12:17,155 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 23:12:17,156 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 23:12:17,157 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 23:12:17,161 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 23:12:17,163 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 23:12:17,163 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 23:12:17,164 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 23:12:17,164 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 23:12:17,165 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 23:12:17,165 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 23:12:17,165 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 23:12:17,166 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 23:12:17,166 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 23:12:17,167 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 23:12:17,167 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 23:12:17,167 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 23:12:17,168 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 23:12:17,168 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 23:12:17,169 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 23:12:17,169 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 23:12:17,170 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-14 23:12:17,194 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 23:12:17,195 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 23:12:17,196 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 23:12:17,196 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 23:12:17,197 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 23:12:17,197 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 23:12:17,197 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 23:12:17,197 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-14 23:12:17,197 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-14 23:12:17,197 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-14 23:12:17,198 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-14 23:12:17,198 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-14 23:12:17,198 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-14 23:12:17,198 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 23:12:17,199 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 23:12:17,199 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 23:12:17,199 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 23:12:17,199 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 23:12:17,199 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 23:12:17,199 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-14 23:12:17,199 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-14 23:12:17,200 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-14 23:12:17,200 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 23:12:17,200 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 23:12:17,200 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-14 23:12:17,200 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 23:12:17,200 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-14 23:12:17,200 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 23:12:17,200 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 23:12:17,201 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 23:12:17,201 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 23:12:17,201 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 23:12:17,202 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-14 23:12:17,202 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 -> c0f4ea6e3bcbb2b79339dce82d9fa934022810e04d651b4bbb6fb3904b8f8c98 [2021-12-14 23:12:17,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 23:12:17,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 23:12:17,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 23:12:17,439 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 23:12:17,440 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 23:12:17,441 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_6.c [2021-12-14 23:12:17,487 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf567133b/2fe5bef09ba94815931fffd977d5825f/FLAG99e92997f [2021-12-14 23:12:17,788 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 23:12:17,788 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_6.c [2021-12-14 23:12:17,793 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf567133b/2fe5bef09ba94815931fffd977d5825f/FLAG99e92997f [2021-12-14 23:12:18,229 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf567133b/2fe5bef09ba94815931fffd977d5825f [2021-12-14 23:12:18,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 23:12:18,235 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 23:12:18,238 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 23:12:18,238 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 23:12:18,240 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 23:12:18,241 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:12:18" (1/1) ... [2021-12-14 23:12:18,242 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34d10464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:12:18, skipping insertion in model container [2021-12-14 23:12:18,242 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:12:18" (1/1) ... [2021-12-14 23:12:18,246 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 23:12:18,259 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 23:12:18,401 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_6.c[2544,2557] [2021-12-14 23:12:18,404 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 23:12:18,413 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 23:12:18,432 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_6.c[2544,2557] [2021-12-14 23:12:18,440 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 23:12:18,448 INFO L208 MainTranslator]: Completed translation [2021-12-14 23:12:18,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:12:18 WrapperNode [2021-12-14 23:12:18,450 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 23:12:18,451 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 23:12:18,451 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 23:12:18,451 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 23:12:18,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:12:18" (1/1) ... [2021-12-14 23:12:18,460 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:12:18" (1/1) ... [2021-12-14 23:12:18,475 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 87 [2021-12-14 23:12:18,476 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 23:12:18,476 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 23:12:18,477 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 23:12:18,477 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 23:12:18,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:12:18" (1/1) ... [2021-12-14 23:12:18,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:12:18" (1/1) ... [2021-12-14 23:12:18,488 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:12:18" (1/1) ... [2021-12-14 23:12:18,488 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:12:18" (1/1) ... [2021-12-14 23:12:18,496 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:12:18" (1/1) ... [2021-12-14 23:12:18,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:12:18" (1/1) ... [2021-12-14 23:12:18,502 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:12:18" (1/1) ... [2021-12-14 23:12:18,504 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 23:12:18,506 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 23:12:18,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 23:12:18,507 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 23:12:18,508 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:12:18" (1/1) ... [2021-12-14 23:12:18,513 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:12:18,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:12:18,530 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:12:18,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-14 23:12:18,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 23:12:18,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 23:12:18,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 23:12:18,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 23:12:18,631 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 23:12:18,633 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 23:12:18,768 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 23:12:18,772 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 23:12:18,776 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-14 23:12:18,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:12:18 BoogieIcfgContainer [2021-12-14 23:12:18,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 23:12:18,779 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-14 23:12:18,791 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-14 23:12:18,793 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-14 23:12:18,794 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:12:18,794 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.12 11:12:18" (1/3) ... [2021-12-14 23:12:18,795 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c5b47e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.12 11:12:18, skipping insertion in model container [2021-12-14 23:12:18,795 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:12:18,795 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:12:18" (2/3) ... [2021-12-14 23:12:18,795 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c5b47e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.12 11:12:18, skipping insertion in model container [2021-12-14 23:12:18,795 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:12:18,795 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:12:18" (3/3) ... [2021-12-14 23:12:18,796 INFO L388 chiAutomizerObserver]: Analyzing ICFG test_locks_6.c [2021-12-14 23:12:18,839 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-14 23:12:18,839 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-14 23:12:18,839 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-14 23:12:18,839 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-14 23:12:18,839 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-14 23:12:18,839 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-14 23:12:18,839 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-14 23:12:18,840 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-14 23:12:18,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 26 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:12:18,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2021-12-14 23:12:18,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:12:18,858 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:12:18,861 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:12:18,861 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:12:18,861 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-14 23:12:18,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 26 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:12:18,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2021-12-14 23:12:18,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:12:18,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:12:18,863 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:12:18,864 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:12:18,867 INFO L791 eck$LassoCheckResult]: Stem: 17#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); 9#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_~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_~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;havoc main_~cond~0#1; 12#L99-1true [2021-12-14 23:12:18,868 INFO L793 eck$LassoCheckResult]: Loop: 12#L99-1true assume !false;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 8#L31true 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; 15#L48true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 4#L48-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 28#L52-1true assume !(0 != main_~p3~0#1); 21#L56-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 6#L60-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 25#L64-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 24#L68-1true assume !(0 != main_~p1~0#1); 27#L74-1true assume !(0 != main_~p2~0#1); 13#L79-1true assume !(0 != main_~p3~0#1); 23#L84-1true assume !(0 != main_~p4~0#1); 14#L89-1true assume !(0 != main_~p5~0#1); 11#L94-1true assume !(0 != main_~p6~0#1); 12#L99-1true [2021-12-14 23:12:18,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:18,871 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-14 23:12:18,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:18,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945963212] [2021-12-14 23:12:18,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:18,878 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:18,924 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:12:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:18,939 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:12:18,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:18,941 INFO L85 PathProgramCache]: Analyzing trace with hash -11500681, now seen corresponding path program 1 times [2021-12-14 23:12:18,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:18,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715785687] [2021-12-14 23:12:18,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:18,942 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:12:18,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:12:18,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:12:18,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715785687] [2021-12-14 23:12:18,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715785687] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:12:18,997 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:12:18,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 23:12:18,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010596244] [2021-12-14 23:12:18,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:12:19,002 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-14 23:12:19,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:12:19,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:12:19,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:12:19,027 INFO L87 Difference]: Start difference. First operand has 27 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 26 states have internal predecessors, (47), 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 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:12:19,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:12:19,045 INFO L93 Difference]: Finished difference Result 51 states and 82 transitions. [2021-12-14 23:12:19,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:12:19,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 82 transitions. [2021-12-14 23:12:19,050 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2021-12-14 23:12:19,052 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 41 states and 63 transitions. [2021-12-14 23:12:19,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2021-12-14 23:12:19,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2021-12-14 23:12:19,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 63 transitions. [2021-12-14 23:12:19,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:12:19,054 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 63 transitions. [2021-12-14 23:12:19,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 63 transitions. [2021-12-14 23:12:19,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2021-12-14 23:12:19,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 40 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:12:19,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 63 transitions. [2021-12-14 23:12:19,078 INFO L704 BuchiCegarLoop]: Abstraction has 41 states and 63 transitions. [2021-12-14 23:12:19,078 INFO L587 BuchiCegarLoop]: Abstraction has 41 states and 63 transitions. [2021-12-14 23:12:19,078 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-14 23:12:19,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 63 transitions. [2021-12-14 23:12:19,079 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2021-12-14 23:12:19,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:12:19,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:12:19,080 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:12:19,080 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:12:19,080 INFO L791 eck$LassoCheckResult]: Stem: 89#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); 90#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_~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_~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;havoc main_~cond~0#1; 104#L99-1 [2021-12-14 23:12:19,080 INFO L793 eck$LassoCheckResult]: Loop: 104#L99-1 assume !false;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 119#L31 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; 118#L48 assume !(0 != main_~p1~0#1); 87#L48-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 88#L52-1 assume !(0 != main_~p3~0#1); 117#L56-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 116#L60-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 115#L64-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 114#L68-1 assume !(0 != main_~p1~0#1); 111#L74-1 assume !(0 != main_~p2~0#1); 109#L79-1 assume !(0 != main_~p3~0#1); 92#L84-1 assume !(0 != main_~p4~0#1); 123#L89-1 assume !(0 != main_~p5~0#1); 121#L94-1 assume !(0 != main_~p6~0#1); 104#L99-1 [2021-12-14 23:12:19,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:19,081 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-12-14 23:12:19,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:19,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432381666] [2021-12-14 23:12:19,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:19,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:19,087 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:12:19,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:19,092 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:12:19,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:19,092 INFO L85 PathProgramCache]: Analyzing trace with hash 246664757, now seen corresponding path program 1 times [2021-12-14 23:12:19,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:19,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059801094] [2021-12-14 23:12:19,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:19,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:12:19,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:12:19,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:12:19,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059801094] [2021-12-14 23:12:19,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059801094] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:12:19,110 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:12:19,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 23:12:19,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678733582] [2021-12-14 23:12:19,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:12:19,111 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-14 23:12:19,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:12:19,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:12:19,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:12:19,119 INFO L87 Difference]: Start difference. First operand 41 states and 63 transitions. cyclomatic complexity: 24 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:12:19,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:12:19,129 INFO L93 Difference]: Finished difference Result 78 states and 118 transitions. [2021-12-14 23:12:19,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:12:19,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 118 transitions. [2021-12-14 23:12:19,131 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 76 [2021-12-14 23:12:19,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 78 states and 118 transitions. [2021-12-14 23:12:19,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2021-12-14 23:12:19,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2021-12-14 23:12:19,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 118 transitions. [2021-12-14 23:12:19,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:12:19,133 INFO L681 BuchiCegarLoop]: Abstraction has 78 states and 118 transitions. [2021-12-14 23:12:19,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 118 transitions. [2021-12-14 23:12:19,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-12-14 23:12:19,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.5128205128205128) internal successors, (118), 77 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:12:19,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 118 transitions. [2021-12-14 23:12:19,138 INFO L704 BuchiCegarLoop]: Abstraction has 78 states and 118 transitions. [2021-12-14 23:12:19,138 INFO L587 BuchiCegarLoop]: Abstraction has 78 states and 118 transitions. [2021-12-14 23:12:19,138 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-14 23:12:19,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 118 transitions. [2021-12-14 23:12:19,139 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 76 [2021-12-14 23:12:19,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:12:19,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:12:19,140 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:12:19,140 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:12:19,140 INFO L791 eck$LassoCheckResult]: Stem: 214#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); 215#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_~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_~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;havoc main_~cond~0#1; 227#L99-1 [2021-12-14 23:12:19,140 INFO L793 eck$LassoCheckResult]: Loop: 227#L99-1 assume !false;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 263#L31 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; 259#L48 assume !(0 != main_~p1~0#1); 258#L48-2 assume !(0 != main_~p2~0#1); 257#L52-1 assume !(0 != main_~p3~0#1); 255#L56-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 253#L60-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 251#L64-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 249#L68-1 assume !(0 != main_~p1~0#1); 240#L74-1 assume !(0 != main_~p2~0#1); 238#L79-1 assume !(0 != main_~p3~0#1); 217#L84-1 assume !(0 != main_~p4~0#1); 276#L89-1 assume !(0 != main_~p5~0#1); 272#L94-1 assume !(0 != main_~p6~0#1); 227#L99-1 [2021-12-14 23:12:19,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:19,141 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-12-14 23:12:19,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:19,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599280589] [2021-12-14 23:12:19,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:19,141 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:19,149 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:12:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:19,153 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:12:19,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:19,154 INFO L85 PathProgramCache]: Analyzing trace with hash 947729335, now seen corresponding path program 1 times [2021-12-14 23:12:19,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:19,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665236922] [2021-12-14 23:12:19,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:19,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:12:19,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:12:19,173 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:12:19,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665236922] [2021-12-14 23:12:19,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665236922] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:12:19,174 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:12:19,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 23:12:19,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324108299] [2021-12-14 23:12:19,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:12:19,175 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-14 23:12:19,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:12:19,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:12:19,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:12:19,175 INFO L87 Difference]: Start difference. First operand 78 states and 118 transitions. cyclomatic complexity: 44 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:12:19,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:12:19,185 INFO L93 Difference]: Finished difference Result 150 states and 222 transitions. [2021-12-14 23:12:19,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:12:19,186 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 222 transitions. [2021-12-14 23:12:19,188 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 148 [2021-12-14 23:12:19,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 150 states and 222 transitions. [2021-12-14 23:12:19,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 150 [2021-12-14 23:12:19,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 150 [2021-12-14 23:12:19,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 222 transitions. [2021-12-14 23:12:19,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:12:19,191 INFO L681 BuchiCegarLoop]: Abstraction has 150 states and 222 transitions. [2021-12-14 23:12:19,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 222 transitions. [2021-12-14 23:12:19,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2021-12-14 23:12:19,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 150 states have (on average 1.48) internal successors, (222), 149 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:12:19,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 222 transitions. [2021-12-14 23:12:19,203 INFO L704 BuchiCegarLoop]: Abstraction has 150 states and 222 transitions. [2021-12-14 23:12:19,203 INFO L587 BuchiCegarLoop]: Abstraction has 150 states and 222 transitions. [2021-12-14 23:12:19,203 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-14 23:12:19,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 222 transitions. [2021-12-14 23:12:19,205 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 148 [2021-12-14 23:12:19,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:12:19,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:12:19,206 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:12:19,206 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:12:19,206 INFO L791 eck$LassoCheckResult]: Stem: 448#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); 449#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_~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_~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;havoc main_~cond~0#1; 461#L99-1 [2021-12-14 23:12:19,206 INFO L793 eck$LassoCheckResult]: Loop: 461#L99-1 assume !false;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 503#L31 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; 498#L48 assume !(0 != main_~p1~0#1); 492#L48-2 assume !(0 != main_~p2~0#1); 485#L52-1 assume !(0 != main_~p3~0#1); 486#L56-1 assume !(0 != main_~p4~0#1); 546#L60-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 545#L64-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 539#L68-1 assume !(0 != main_~p1~0#1); 541#L74-1 assume !(0 != main_~p2~0#1); 538#L79-1 assume !(0 != main_~p3~0#1); 536#L84-1 assume !(0 != main_~p4~0#1); 535#L89-1 assume !(0 != main_~p5~0#1); 517#L94-1 assume !(0 != main_~p6~0#1); 461#L99-1 [2021-12-14 23:12:19,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:19,207 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-12-14 23:12:19,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:19,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505645684] [2021-12-14 23:12:19,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:19,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:19,212 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:12:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:19,216 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:12:19,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:19,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1627787705, now seen corresponding path program 1 times [2021-12-14 23:12:19,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:19,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633419573] [2021-12-14 23:12:19,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:19,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:19,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:12:19,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:12:19,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:12:19,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633419573] [2021-12-14 23:12:19,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633419573] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:12:19,233 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:12:19,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 23:12:19,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793573512] [2021-12-14 23:12:19,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:12:19,233 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-14 23:12:19,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:12:19,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:12:19,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:12:19,234 INFO L87 Difference]: Start difference. First operand 150 states and 222 transitions. cyclomatic complexity: 80 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:12:19,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:12:19,245 INFO L93 Difference]: Finished difference Result 290 states and 418 transitions. [2021-12-14 23:12:19,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:12:19,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 290 states and 418 transitions. [2021-12-14 23:12:19,249 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 288 [2021-12-14 23:12:19,251 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 290 states to 290 states and 418 transitions. [2021-12-14 23:12:19,251 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 290 [2021-12-14 23:12:19,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 290 [2021-12-14 23:12:19,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 290 states and 418 transitions. [2021-12-14 23:12:19,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:12:19,253 INFO L681 BuchiCegarLoop]: Abstraction has 290 states and 418 transitions. [2021-12-14 23:12:19,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states and 418 transitions. [2021-12-14 23:12:19,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2021-12-14 23:12:19,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 290 states have (on average 1.4413793103448276) internal successors, (418), 289 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:12:19,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 418 transitions. [2021-12-14 23:12:19,269 INFO L704 BuchiCegarLoop]: Abstraction has 290 states and 418 transitions. [2021-12-14 23:12:19,269 INFO L587 BuchiCegarLoop]: Abstraction has 290 states and 418 transitions. [2021-12-14 23:12:19,269 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-14 23:12:19,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 290 states and 418 transitions. [2021-12-14 23:12:19,271 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 288 [2021-12-14 23:12:19,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:12:19,272 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:12:19,272 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:12:19,272 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:12:19,272 INFO L791 eck$LassoCheckResult]: Stem: 894#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); 895#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_~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_~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;havoc main_~cond~0#1; 907#L99-1 [2021-12-14 23:12:19,272 INFO L793 eck$LassoCheckResult]: Loop: 907#L99-1 assume !false;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 955#L31 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; 953#L48 assume !(0 != main_~p1~0#1); 949#L48-2 assume !(0 != main_~p2~0#1); 947#L52-1 assume !(0 != main_~p3~0#1); 943#L56-1 assume !(0 != main_~p4~0#1); 939#L60-1 assume !(0 != main_~p5~0#1); 937#L64-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 934#L68-1 assume !(0 != main_~p1~0#1); 935#L74-1 assume !(0 != main_~p2~0#1); 971#L79-1 assume !(0 != main_~p3~0#1); 966#L84-1 assume !(0 != main_~p4~0#1); 962#L89-1 assume !(0 != main_~p5~0#1); 959#L94-1 assume !(0 != main_~p6~0#1); 907#L99-1 [2021-12-14 23:12:19,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:19,273 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-12-14 23:12:19,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:19,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528176301] [2021-12-14 23:12:19,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:19,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:19,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:19,277 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:12:19,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:19,281 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:12:19,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:19,281 INFO L85 PathProgramCache]: Analyzing trace with hash 818441079, now seen corresponding path program 1 times [2021-12-14 23:12:19,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:19,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459092227] [2021-12-14 23:12:19,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:19,282 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:12:19,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:12:19,295 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:12:19,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459092227] [2021-12-14 23:12:19,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459092227] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:12:19,295 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:12:19,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 23:12:19,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663076283] [2021-12-14 23:12:19,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:12:19,296 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-14 23:12:19,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:12:19,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:12:19,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:12:19,297 INFO L87 Difference]: Start difference. First operand 290 states and 418 transitions. cyclomatic complexity: 144 Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:12:19,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:12:19,308 INFO L93 Difference]: Finished difference Result 562 states and 786 transitions. [2021-12-14 23:12:19,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:12:19,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 562 states and 786 transitions. [2021-12-14 23:12:19,312 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 560 [2021-12-14 23:12:19,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 562 states to 562 states and 786 transitions. [2021-12-14 23:12:19,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 562 [2021-12-14 23:12:19,316 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 562 [2021-12-14 23:12:19,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 562 states and 786 transitions. [2021-12-14 23:12:19,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:12:19,318 INFO L681 BuchiCegarLoop]: Abstraction has 562 states and 786 transitions. [2021-12-14 23:12:19,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states and 786 transitions. [2021-12-14 23:12:19,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2021-12-14 23:12:19,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 562 states have (on average 1.398576512455516) internal successors, (786), 561 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:12:19,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 786 transitions. [2021-12-14 23:12:19,333 INFO L704 BuchiCegarLoop]: Abstraction has 562 states and 786 transitions. [2021-12-14 23:12:19,334 INFO L587 BuchiCegarLoop]: Abstraction has 562 states and 786 transitions. [2021-12-14 23:12:19,334 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-14 23:12:19,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 562 states and 786 transitions. [2021-12-14 23:12:19,343 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 560 [2021-12-14 23:12:19,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:12:19,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:12:19,344 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:12:19,344 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:12:19,344 INFO L791 eck$LassoCheckResult]: Stem: 1752#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); 1753#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_~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_~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;havoc main_~cond~0#1; 1765#L99-1 [2021-12-14 23:12:19,344 INFO L793 eck$LassoCheckResult]: Loop: 1765#L99-1 assume !false;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 1846#L31 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; 1842#L48 assume !(0 != main_~p1~0#1); 1835#L48-2 assume !(0 != main_~p2~0#1); 1830#L52-1 assume !(0 != main_~p3~0#1); 1823#L56-1 assume !(0 != main_~p4~0#1); 1815#L60-1 assume !(0 != main_~p5~0#1); 1809#L64-1 assume !(0 != main_~p6~0#1); 1803#L68-1 assume !(0 != main_~p1~0#1); 1804#L74-1 assume !(0 != main_~p2~0#1); 1873#L79-1 assume !(0 != main_~p3~0#1); 1864#L84-1 assume !(0 != main_~p4~0#1); 1857#L89-1 assume !(0 != main_~p5~0#1); 1853#L94-1 assume !(0 != main_~p6~0#1); 1765#L99-1 [2021-12-14 23:12:19,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:19,345 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-12-14 23:12:19,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:19,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817120667] [2021-12-14 23:12:19,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:19,346 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:19,354 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:12:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:19,358 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:12:19,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:19,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1701518855, now seen corresponding path program 1 times [2021-12-14 23:12:19,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:19,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198224500] [2021-12-14 23:12:19,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:19,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:19,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:19,363 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:12:19,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:19,371 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:12:19,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:19,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1159342651, now seen corresponding path program 1 times [2021-12-14 23:12:19,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:19,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692017997] [2021-12-14 23:12:19,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:19,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:19,377 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:12:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:19,385 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:12:19,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.12 11:12:19 BoogieIcfgContainer [2021-12-14 23:12:19,574 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-14 23:12:19,574 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 23:12:19,574 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 23:12:19,574 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 23:12:19,575 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:12:18" (3/4) ... [2021-12-14 23:12:19,576 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-12-14 23:12:19,598 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 23:12:19,599 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 23:12:19,599 INFO L158 Benchmark]: Toolchain (without parser) took 1364.54ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 54.5MB in the beginning and 66.1MB in the end (delta: -11.5MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2021-12-14 23:12:19,600 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 90.2MB. Free memory was 70.7MB in the beginning and 70.6MB in the end (delta: 45.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 23:12:19,600 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.50ms. Allocated memory is still 90.2MB. Free memory was 54.3MB in the beginning and 67.5MB in the end (delta: -13.2MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2021-12-14 23:12:19,600 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.24ms. Allocated memory is still 90.2MB. Free memory was 67.5MB in the beginning and 65.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 23:12:19,601 INFO L158 Benchmark]: Boogie Preprocessor took 28.69ms. Allocated memory is still 90.2MB. Free memory was 65.9MB in the beginning and 64.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 23:12:19,601 INFO L158 Benchmark]: RCFGBuilder took 272.27ms. Allocated memory is still 90.2MB. Free memory was 64.6MB in the beginning and 54.6MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-14 23:12:19,601 INFO L158 Benchmark]: BuchiAutomizer took 795.12ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 54.6MB in the beginning and 68.2MB in the end (delta: -13.5MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. [2021-12-14 23:12:19,603 INFO L158 Benchmark]: Witness Printer took 24.75ms. Allocated memory is still 109.1MB. Free memory was 68.2MB in the beginning and 66.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 23:12:19,604 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.15ms. Allocated memory is still 90.2MB. Free memory was 70.7MB in the beginning and 70.6MB in the end (delta: 45.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.50ms. Allocated memory is still 90.2MB. Free memory was 54.3MB in the beginning and 67.5MB in the end (delta: -13.2MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.24ms. Allocated memory is still 90.2MB. Free memory was 67.5MB in the beginning and 65.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.69ms. Allocated memory is still 90.2MB. Free memory was 65.9MB in the beginning and 64.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 272.27ms. Allocated memory is still 90.2MB. Free memory was 64.6MB in the beginning and 54.6MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 795.12ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 54.6MB in the beginning and 68.2MB in the end (delta: -13.5MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. * Witness Printer took 24.75ms. Allocated memory is still 109.1MB. Free memory was 68.2MB in the beginning and 66.1MB in the end (delta: 2.1MB). 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 5 terminating modules (5 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.5 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 562 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.7s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 0.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 562 states and ocurred in iteration 5. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 130 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 130 mSDsluCounter, 405 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 149 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25 IncrementalHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 256 mSDtfsCounter, 25 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI5 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 29]: 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 {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@724f2c7f=0, p3=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2bf3adf1=0, lk5=0, p1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@d4ae6be=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3e843ea5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@60aa6ae9=0, NULL=1, \result=0, cond=4, p5=0, lk2=0, p4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@30c7b104=4, p6=0, NULL=0, p2=0, lk4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3b605ec3=0, lk6=0, lk1=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 29]: 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; [L27] int cond; Loop: [L29] COND TRUE 1 [L30] cond = __VERIFIER_nondet_int() [L31] COND FALSE !(cond == 0) [L34] lk1 = 0 [L36] lk2 = 0 [L38] lk3 = 0 [L40] lk4 = 0 [L42] lk5 = 0 [L44] lk6 = 0 [L48] COND FALSE !(p1 != 0) [L52] COND FALSE !(p2 != 0) [L56] COND FALSE !(p3 != 0) [L60] COND FALSE !(p4 != 0) [L64] COND FALSE !(p5 != 0) [L68] COND FALSE !(p6 != 0) [L74] COND FALSE !(p1 != 0) [L79] COND FALSE !(p2 != 0) [L84] COND FALSE !(p3 != 0) [L89] COND FALSE !(p4 != 0) [L94] COND FALSE !(p5 != 0) [L99] COND FALSE !(p6 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-12-14 23:12:19,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with 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)