./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_7.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_7.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 05c715fd95d2209519e9aa0425ca71b72050ac0ff5d332c8a9deb8ead8471230 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 23:12:18,584 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 23:12:18,586 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 23:12:18,621 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 23:12:18,622 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 23:12:18,624 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 23:12:18,625 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 23:12:18,627 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 23:12:18,629 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 23:12:18,632 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 23:12:18,632 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 23:12:18,633 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 23:12:18,634 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 23:12:18,635 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 23:12:18,637 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 23:12:18,641 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 23:12:18,642 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 23:12:18,643 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 23:12:18,644 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 23:12:18,646 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 23:12:18,647 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 23:12:18,648 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 23:12:18,649 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 23:12:18,649 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 23:12:18,652 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 23:12:18,652 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 23:12:18,652 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 23:12:18,653 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 23:12:18,653 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 23:12:18,654 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 23:12:18,654 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 23:12:18,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 23:12:18,655 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 23:12:18,656 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 23:12:18,657 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 23:12:18,658 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 23:12:18,658 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 23:12:18,658 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 23:12:18,659 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 23:12:18,659 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 23:12:18,659 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 23:12:18,660 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:18,676 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 23:12:18,679 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 23:12:18,679 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 23:12:18,680 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 23:12:18,681 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 23:12:18,681 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 23:12:18,681 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 23:12:18,681 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-14 23:12:18,681 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-14 23:12:18,681 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-14 23:12:18,682 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-14 23:12:18,682 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-14 23:12:18,682 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-14 23:12:18,682 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 23:12:18,682 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 23:12:18,683 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 23:12:18,683 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 23:12:18,683 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 23:12:18,683 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 23:12:18,683 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-14 23:12:18,683 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-14 23:12:18,683 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-14 23:12:18,684 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 23:12:18,684 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 23:12:18,684 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-14 23:12:18,684 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 23:12:18,684 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-14 23:12:18,684 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 23:12:18,685 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 23:12:18,685 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 23:12:18,685 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 23:12:18,685 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 23:12:18,686 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-14 23:12:18,686 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 -> 05c715fd95d2209519e9aa0425ca71b72050ac0ff5d332c8a9deb8ead8471230 [2021-12-14 23:12:18,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 23:12:18,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 23:12:18,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 23:12:18,891 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 23:12:18,892 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 23:12:18,893 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_7.c [2021-12-14 23:12:18,963 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30d3bf6be/5fa67d1a62d6479098b7ae08e6b1a14b/FLAG151b90ca8 [2021-12-14 23:12:19,311 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 23:12:19,312 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_7.c [2021-12-14 23:12:19,317 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30d3bf6be/5fa67d1a62d6479098b7ae08e6b1a14b/FLAG151b90ca8 [2021-12-14 23:12:19,325 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30d3bf6be/5fa67d1a62d6479098b7ae08e6b1a14b [2021-12-14 23:12:19,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 23:12:19,328 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 23:12:19,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 23:12:19,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 23:12:19,331 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 23:12:19,332 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:12:19" (1/1) ... [2021-12-14 23:12:19,332 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@555756a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:12:19, skipping insertion in model container [2021-12-14 23:12:19,332 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:12:19" (1/1) ... [2021-12-14 23:12:19,337 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 23:12:19,346 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 23:12:19,482 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_7.c[2881,2894] [2021-12-14 23:12:19,483 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 23:12:19,489 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 23:12:19,500 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_7.c[2881,2894] [2021-12-14 23:12:19,501 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 23:12:19,509 INFO L208 MainTranslator]: Completed translation [2021-12-14 23:12:19,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:12:19 WrapperNode [2021-12-14 23:12:19,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 23:12:19,511 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 23:12:19,511 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 23:12:19,511 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 23:12:19,516 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:19" (1/1) ... [2021-12-14 23:12:19,521 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:19" (1/1) ... [2021-12-14 23:12:19,540 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 97 [2021-12-14 23:12:19,540 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 23:12:19,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 23:12:19,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 23:12:19,541 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 23:12:19,546 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:19" (1/1) ... [2021-12-14 23:12:19,546 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:19" (1/1) ... [2021-12-14 23:12:19,548 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:19" (1/1) ... [2021-12-14 23:12:19,548 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:19" (1/1) ... [2021-12-14 23:12:19,550 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:19" (1/1) ... [2021-12-14 23:12:19,552 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:19" (1/1) ... [2021-12-14 23:12:19,553 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:19" (1/1) ... [2021-12-14 23:12:19,558 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 23:12:19,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 23:12:19,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 23:12:19,559 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 23:12:19,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:12:19" (1/1) ... [2021-12-14 23:12:19,574 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:12:19,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:12:19,608 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:19,627 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:19,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 23:12:19,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 23:12:19,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 23:12:19,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 23:12:19,683 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 23:12:19,685 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 23:12:19,808 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 23:12:19,816 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 23:12:19,816 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-14 23:12:19,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:12:19 BoogieIcfgContainer [2021-12-14 23:12:19,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 23:12:19,818 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-14 23:12:19,818 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-14 23:12:19,821 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-14 23:12:19,821 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:12:19,821 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.12 11:12:19" (1/3) ... [2021-12-14 23:12:19,822 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1bde21c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.12 11:12:19, skipping insertion in model container [2021-12-14 23:12:19,822 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:12:19,822 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:12:19" (2/3) ... [2021-12-14 23:12:19,826 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1bde21c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.12 11:12:19, skipping insertion in model container [2021-12-14 23:12:19,826 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:12:19,826 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:12:19" (3/3) ... [2021-12-14 23:12:19,827 INFO L388 chiAutomizerObserver]: Analyzing ICFG test_locks_7.c [2021-12-14 23:12:19,855 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-14 23:12:19,855 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-14 23:12:19,855 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-14 23:12:19,855 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-14 23:12:19,855 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-14 23:12:19,855 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-14 23:12:19,855 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-14 23:12:19,855 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-14 23:12:19,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 29 states have internal predecessors, (53), 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,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2021-12-14 23:12:19,880 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:12:19,880 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:12:19,884 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:12:19,885 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:12:19,885 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-14 23:12:19,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 29 states have internal predecessors, (53), 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,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2021-12-14 23:12:19,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:12:19,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:12:19,887 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:12:19,887 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:12:19,892 INFO L791 eck$LassoCheckResult]: Stem: 21#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); 6#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_~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_~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;havoc main_~cond~0#1; 18#L113-1true [2021-12-14 23:12:19,895 INFO L793 eck$LassoCheckResult]: Loop: 18#L113-1true assume !false;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 29#L34true 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; 30#L53true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 4#L53-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 13#L57-1true assume !(0 != main_~p3~0#1); 10#L61-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 26#L65-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 28#L69-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 12#L73-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 25#L77-1true assume !(0 != main_~p1~0#1); 31#L83-1true assume !(0 != main_~p2~0#1); 15#L88-1true assume !(0 != main_~p3~0#1); 11#L93-1true assume !(0 != main_~p4~0#1); 16#L98-1true assume !(0 != main_~p5~0#1); 8#L103-1true assume !(0 != main_~p6~0#1); 14#L108-1true assume !(0 != main_~p7~0#1); 18#L113-1true [2021-12-14 23:12:19,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:19,899 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-14 23:12:19,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:19,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404987572] [2021-12-14 23:12:19,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:19,906 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:19,972 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:12:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:19,987 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:12:19,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:19,989 INFO L85 PathProgramCache]: Analyzing trace with hash -2067454588, now seen corresponding path program 1 times [2021-12-14 23:12:19,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:19,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151033269] [2021-12-14 23:12:19,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:19,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:12:20,067 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:20,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:12:20,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151033269] [2021-12-14 23:12:20,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151033269] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:12:20,068 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:12:20,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 23:12:20,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879233273] [2021-12-14 23:12:20,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:12:20,072 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-14 23:12:20,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:12:20,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:12:20,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:12:20,108 INFO L87 Difference]: Start difference. First operand has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 29 states have internal predecessors, (53), 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 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:20,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:12:20,154 INFO L93 Difference]: Finished difference Result 57 states and 94 transitions. [2021-12-14 23:12:20,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:12:20,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 94 transitions. [2021-12-14 23:12:20,164 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2021-12-14 23:12:20,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 47 states and 73 transitions. [2021-12-14 23:12:20,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2021-12-14 23:12:20,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2021-12-14 23:12:20,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 73 transitions. [2021-12-14 23:12:20,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:12:20,171 INFO L681 BuchiCegarLoop]: Abstraction has 47 states and 73 transitions. [2021-12-14 23:12:20,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 73 transitions. [2021-12-14 23:12:20,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2021-12-14 23:12:20,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.553191489361702) internal successors, (73), 46 states have internal predecessors, (73), 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:20,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 73 transitions. [2021-12-14 23:12:20,206 INFO L704 BuchiCegarLoop]: Abstraction has 47 states and 73 transitions. [2021-12-14 23:12:20,206 INFO L587 BuchiCegarLoop]: Abstraction has 47 states and 73 transitions. [2021-12-14 23:12:20,206 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-14 23:12:20,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 73 transitions. [2021-12-14 23:12:20,208 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2021-12-14 23:12:20,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:12:20,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:12:20,209 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:12:20,209 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:12:20,209 INFO L791 eck$LassoCheckResult]: Stem: 119#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); 100#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_~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_~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;havoc main_~cond~0#1; 101#L113-1 [2021-12-14 23:12:20,209 INFO L793 eck$LassoCheckResult]: Loop: 101#L113-1 assume !false;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 116#L34 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; 121#L53 assume !(0 != main_~p1~0#1); 123#L53-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 142#L57-1 assume !(0 != main_~p3~0#1); 141#L61-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 140#L65-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 139#L69-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 138#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 137#L77-1 assume !(0 != main_~p1~0#1); 136#L83-1 assume !(0 != main_~p2~0#1); 134#L88-1 assume !(0 != main_~p3~0#1); 132#L93-1 assume !(0 != main_~p4~0#1); 129#L98-1 assume !(0 != main_~p5~0#1); 104#L103-1 assume !(0 != main_~p6~0#1); 106#L108-1 assume !(0 != main_~p7~0#1); 101#L113-1 [2021-12-14 23:12:20,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:20,210 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-12-14 23:12:20,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:20,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283922442] [2021-12-14 23:12:20,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:20,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:20,218 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:12:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:20,223 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:12:20,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:20,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1216395458, now seen corresponding path program 1 times [2021-12-14 23:12:20,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:20,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149993637] [2021-12-14 23:12:20,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:20,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:12:20,246 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:20,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:12:20,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149993637] [2021-12-14 23:12:20,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149993637] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:12:20,247 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:12:20,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 23:12:20,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128684995] [2021-12-14 23:12:20,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:12:20,248 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-14 23:12:20,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:12:20,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:12:20,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:12:20,249 INFO L87 Difference]: Start difference. First operand 47 states and 73 transitions. cyclomatic complexity: 28 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:20,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:12:20,260 INFO L93 Difference]: Finished difference Result 90 states and 138 transitions. [2021-12-14 23:12:20,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:12:20,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 138 transitions. [2021-12-14 23:12:20,263 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 88 [2021-12-14 23:12:20,264 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 90 states and 138 transitions. [2021-12-14 23:12:20,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2021-12-14 23:12:20,265 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2021-12-14 23:12:20,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 138 transitions. [2021-12-14 23:12:20,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:12:20,265 INFO L681 BuchiCegarLoop]: Abstraction has 90 states and 138 transitions. [2021-12-14 23:12:20,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 138 transitions. [2021-12-14 23:12:20,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2021-12-14 23:12:20,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 90 states have (on average 1.5333333333333334) internal successors, (138), 89 states have internal predecessors, (138), 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:20,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 138 transitions. [2021-12-14 23:12:20,271 INFO L704 BuchiCegarLoop]: Abstraction has 90 states and 138 transitions. [2021-12-14 23:12:20,271 INFO L587 BuchiCegarLoop]: Abstraction has 90 states and 138 transitions. [2021-12-14 23:12:20,271 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-14 23:12:20,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 138 transitions. [2021-12-14 23:12:20,272 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 88 [2021-12-14 23:12:20,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:12:20,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:12:20,273 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:12:20,273 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:12:20,273 INFO L791 eck$LassoCheckResult]: Stem: 266#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); 243#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_~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_~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;havoc main_~cond~0#1; 244#L113-1 [2021-12-14 23:12:20,274 INFO L793 eck$LassoCheckResult]: Loop: 244#L113-1 assume !false;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 305#L34 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; 287#L53 assume !(0 != main_~p1~0#1); 289#L53-2 assume !(0 != main_~p2~0#1); 255#L57-1 assume !(0 != main_~p3~0#1); 250#L61-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 251#L65-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 269#L69-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 293#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 292#L77-1 assume !(0 != main_~p1~0#1); 273#L83-1 assume !(0 != main_~p2~0#1); 274#L88-1 assume !(0 != main_~p3~0#1); 320#L93-1 assume !(0 != main_~p4~0#1); 317#L98-1 assume !(0 != main_~p5~0#1); 315#L103-1 assume !(0 != main_~p6~0#1); 311#L108-1 assume !(0 != main_~p7~0#1); 244#L113-1 [2021-12-14 23:12:20,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:20,274 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-12-14 23:12:20,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:20,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190244944] [2021-12-14 23:12:20,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:20,275 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:20,280 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:12:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:20,285 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:12:20,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:20,285 INFO L85 PathProgramCache]: Analyzing trace with hash 629589444, now seen corresponding path program 1 times [2021-12-14 23:12:20,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:20,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119376677] [2021-12-14 23:12:20,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:20,286 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:20,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:12:20,304 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:20,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:12:20,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119376677] [2021-12-14 23:12:20,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119376677] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:12:20,305 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:12:20,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 23:12:20,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749209365] [2021-12-14 23:12:20,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:12:20,306 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-14 23:12:20,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:12:20,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:12:20,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:12:20,307 INFO L87 Difference]: Start difference. First operand 90 states and 138 transitions. cyclomatic complexity: 52 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:20,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:12:20,319 INFO L93 Difference]: Finished difference Result 174 states and 262 transitions. [2021-12-14 23:12:20,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:12:20,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 262 transitions. [2021-12-14 23:12:20,322 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 172 [2021-12-14 23:12:20,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 174 states and 262 transitions. [2021-12-14 23:12:20,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2021-12-14 23:12:20,324 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2021-12-14 23:12:20,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 262 transitions. [2021-12-14 23:12:20,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:12:20,325 INFO L681 BuchiCegarLoop]: Abstraction has 174 states and 262 transitions. [2021-12-14 23:12:20,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 262 transitions. [2021-12-14 23:12:20,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2021-12-14 23:12:20,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 174 states have (on average 1.5057471264367817) internal successors, (262), 173 states have internal predecessors, (262), 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:20,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 262 transitions. [2021-12-14 23:12:20,333 INFO L704 BuchiCegarLoop]: Abstraction has 174 states and 262 transitions. [2021-12-14 23:12:20,333 INFO L587 BuchiCegarLoop]: Abstraction has 174 states and 262 transitions. [2021-12-14 23:12:20,333 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-14 23:12:20,333 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 262 transitions. [2021-12-14 23:12:20,335 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 172 [2021-12-14 23:12:20,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:12:20,335 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:12:20,335 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:12:20,335 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:12:20,336 INFO L791 eck$LassoCheckResult]: Stem: 536#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); 513#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_~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_~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;havoc main_~cond~0#1; 514#L113-1 [2021-12-14 23:12:20,336 INFO L793 eck$LassoCheckResult]: Loop: 514#L113-1 assume !false;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 575#L34 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; 558#L53 assume !(0 != main_~p1~0#1); 559#L53-2 assume !(0 != main_~p2~0#1); 632#L57-1 assume !(0 != main_~p3~0#1); 629#L61-1 assume !(0 != main_~p4~0#1); 627#L65-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 625#L69-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 623#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 621#L77-1 assume !(0 != main_~p1~0#1); 618#L83-1 assume !(0 != main_~p2~0#1); 615#L88-1 assume !(0 != main_~p3~0#1); 612#L93-1 assume !(0 != main_~p4~0#1); 608#L98-1 assume !(0 != main_~p5~0#1); 605#L103-1 assume !(0 != main_~p6~0#1); 580#L108-1 assume !(0 != main_~p7~0#1); 514#L113-1 [2021-12-14 23:12:20,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:20,336 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-12-14 23:12:20,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:20,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479574313] [2021-12-14 23:12:20,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:20,337 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:20,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:20,342 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:12:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:20,346 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:12:20,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:20,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1330654022, now seen corresponding path program 1 times [2021-12-14 23:12:20,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:20,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663658925] [2021-12-14 23:12:20,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:20,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:12:20,365 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:20,365 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:12:20,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663658925] [2021-12-14 23:12:20,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663658925] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:12:20,366 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:12:20,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 23:12:20,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919267742] [2021-12-14 23:12:20,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:12:20,367 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-14 23:12:20,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:12:20,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:12:20,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:12:20,368 INFO L87 Difference]: Start difference. First operand 174 states and 262 transitions. cyclomatic complexity: 96 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:20,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:12:20,381 INFO L93 Difference]: Finished difference Result 338 states and 498 transitions. [2021-12-14 23:12:20,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:12:20,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 338 states and 498 transitions. [2021-12-14 23:12:20,384 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 336 [2021-12-14 23:12:20,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 338 states to 338 states and 498 transitions. [2021-12-14 23:12:20,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 338 [2021-12-14 23:12:20,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 338 [2021-12-14 23:12:20,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 338 states and 498 transitions. [2021-12-14 23:12:20,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:12:20,389 INFO L681 BuchiCegarLoop]: Abstraction has 338 states and 498 transitions. [2021-12-14 23:12:20,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states and 498 transitions. [2021-12-14 23:12:20,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2021-12-14 23:12:20,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 338 states have (on average 1.4733727810650887) internal successors, (498), 337 states have internal predecessors, (498), 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:20,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 498 transitions. [2021-12-14 23:12:20,402 INFO L704 BuchiCegarLoop]: Abstraction has 338 states and 498 transitions. [2021-12-14 23:12:20,402 INFO L587 BuchiCegarLoop]: Abstraction has 338 states and 498 transitions. [2021-12-14 23:12:20,402 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-14 23:12:20,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 338 states and 498 transitions. [2021-12-14 23:12:20,404 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 336 [2021-12-14 23:12:20,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:12:20,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:12:20,404 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:12:20,404 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:12:20,405 INFO L791 eck$LassoCheckResult]: Stem: 1055#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); 1031#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_~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_~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;havoc main_~cond~0#1; 1032#L113-1 [2021-12-14 23:12:20,405 INFO L793 eck$LassoCheckResult]: Loop: 1032#L113-1 assume !false;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 1129#L34 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; 1114#L53 assume !(0 != main_~p1~0#1); 1116#L53-2 assume !(0 != main_~p2~0#1); 1096#L57-1 assume !(0 != main_~p3~0#1); 1097#L61-1 assume !(0 != main_~p4~0#1); 1168#L65-1 assume !(0 != main_~p5~0#1); 1167#L69-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1166#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1164#L77-1 assume !(0 != main_~p1~0#1); 1160#L83-1 assume !(0 != main_~p2~0#1); 1157#L88-1 assume !(0 != main_~p3~0#1); 1153#L93-1 assume !(0 != main_~p4~0#1); 1154#L98-1 assume !(0 != main_~p5~0#1); 1145#L103-1 assume !(0 != main_~p6~0#1); 1144#L108-1 assume !(0 != main_~p7~0#1); 1032#L113-1 [2021-12-14 23:12:20,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:20,406 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-12-14 23:12:20,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:20,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678101931] [2021-12-14 23:12:20,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:20,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:20,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:20,410 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:12:20,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:20,415 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:12:20,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:20,415 INFO L85 PathProgramCache]: Analyzing trace with hash 937627012, now seen corresponding path program 1 times [2021-12-14 23:12:20,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:20,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836960078] [2021-12-14 23:12:20,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:20,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:12:20,432 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:20,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:12:20,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836960078] [2021-12-14 23:12:20,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836960078] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:12:20,434 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:12:20,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 23:12:20,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276080252] [2021-12-14 23:12:20,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:12:20,434 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-14 23:12:20,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:12:20,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:12:20,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:12:20,435 INFO L87 Difference]: Start difference. First operand 338 states and 498 transitions. cyclomatic complexity: 176 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:20,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:12:20,453 INFO L93 Difference]: Finished difference Result 658 states and 946 transitions. [2021-12-14 23:12:20,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:12:20,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 658 states and 946 transitions. [2021-12-14 23:12:20,458 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 656 [2021-12-14 23:12:20,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 658 states to 658 states and 946 transitions. [2021-12-14 23:12:20,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 658 [2021-12-14 23:12:20,462 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 658 [2021-12-14 23:12:20,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 658 states and 946 transitions. [2021-12-14 23:12:20,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:12:20,464 INFO L681 BuchiCegarLoop]: Abstraction has 658 states and 946 transitions. [2021-12-14 23:12:20,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states and 946 transitions. [2021-12-14 23:12:20,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2021-12-14 23:12:20,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 658 states have (on average 1.4376899696048633) internal successors, (946), 657 states have internal predecessors, (946), 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:20,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 946 transitions. [2021-12-14 23:12:20,480 INFO L704 BuchiCegarLoop]: Abstraction has 658 states and 946 transitions. [2021-12-14 23:12:20,480 INFO L587 BuchiCegarLoop]: Abstraction has 658 states and 946 transitions. [2021-12-14 23:12:20,480 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-14 23:12:20,480 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 658 states and 946 transitions. [2021-12-14 23:12:20,483 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 656 [2021-12-14 23:12:20,483 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:12:20,483 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:12:20,483 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:12:20,483 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:12:20,484 INFO L791 eck$LassoCheckResult]: Stem: 2056#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); 2033#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_~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_~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;havoc main_~cond~0#1; 2034#L113-1 [2021-12-14 23:12:20,484 INFO L793 eck$LassoCheckResult]: Loop: 2034#L113-1 assume !false;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 2163#L34 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; 2159#L53 assume !(0 != main_~p1~0#1); 2157#L53-2 assume !(0 != main_~p2~0#1); 2154#L57-1 assume !(0 != main_~p3~0#1); 2150#L61-1 assume !(0 != main_~p4~0#1); 2147#L65-1 assume !(0 != main_~p5~0#1); 2148#L69-1 assume !(0 != main_~p6~0#1); 2139#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2140#L77-1 assume !(0 != main_~p1~0#1); 2128#L83-1 assume !(0 != main_~p2~0#1); 2130#L88-1 assume !(0 != main_~p3~0#1); 2118#L93-1 assume !(0 != main_~p4~0#1); 2119#L98-1 assume !(0 != main_~p5~0#1); 2172#L103-1 assume !(0 != main_~p6~0#1); 2169#L108-1 assume !(0 != main_~p7~0#1); 2034#L113-1 [2021-12-14 23:12:20,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:20,484 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-12-14 23:12:20,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:20,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71940955] [2021-12-14 23:12:20,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:20,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:20,488 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:12:20,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:20,492 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:12:20,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:20,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1617685382, now seen corresponding path program 1 times [2021-12-14 23:12:20,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:20,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775460675] [2021-12-14 23:12:20,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:20,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:12:20,530 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:20,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:12:20,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775460675] [2021-12-14 23:12:20,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775460675] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:12:20,531 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:12:20,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 23:12:20,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183851274] [2021-12-14 23:12:20,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:12:20,531 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-14 23:12:20,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:12:20,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:12:20,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:12:20,532 INFO L87 Difference]: Start difference. First operand 658 states and 946 transitions. cyclomatic complexity: 320 Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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:20,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:12:20,564 INFO L93 Difference]: Finished difference Result 1282 states and 1794 transitions. [2021-12-14 23:12:20,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:12:20,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1282 states and 1794 transitions. [2021-12-14 23:12:20,572 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1280 [2021-12-14 23:12:20,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1282 states to 1282 states and 1794 transitions. [2021-12-14 23:12:20,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1282 [2021-12-14 23:12:20,577 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1282 [2021-12-14 23:12:20,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1282 states and 1794 transitions. [2021-12-14 23:12:20,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:12:20,578 INFO L681 BuchiCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2021-12-14 23:12:20,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states and 1794 transitions. [2021-12-14 23:12:20,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1282. [2021-12-14 23:12:20,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1282 states have (on average 1.3993759750390016) internal successors, (1794), 1281 states have internal predecessors, (1794), 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:20,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1794 transitions. [2021-12-14 23:12:20,594 INFO L704 BuchiCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2021-12-14 23:12:20,594 INFO L587 BuchiCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2021-12-14 23:12:20,596 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-14 23:12:20,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1282 states and 1794 transitions. [2021-12-14 23:12:20,601 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1280 [2021-12-14 23:12:20,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:12:20,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:12:20,603 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:12:20,603 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:12:20,603 INFO L791 eck$LassoCheckResult]: Stem: 4003#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); 3979#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_~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_~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;havoc main_~cond~0#1; 3980#L113-1 [2021-12-14 23:12:20,604 INFO L793 eck$LassoCheckResult]: Loop: 3980#L113-1 assume !false;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 4339#L34 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; 4336#L53 assume !(0 != main_~p1~0#1); 4332#L53-2 assume !(0 != main_~p2~0#1); 4329#L57-1 assume !(0 != main_~p3~0#1); 4326#L61-1 assume !(0 != main_~p4~0#1); 4322#L65-1 assume !(0 != main_~p5~0#1); 4323#L69-1 assume !(0 != main_~p6~0#1); 4367#L73-1 assume !(0 != main_~p7~0#1); 4361#L77-1 assume !(0 != main_~p1~0#1); 4356#L83-1 assume !(0 != main_~p2~0#1); 4352#L88-1 assume !(0 != main_~p3~0#1); 4348#L93-1 assume !(0 != main_~p4~0#1); 4346#L98-1 assume !(0 != main_~p5~0#1); 4345#L103-1 assume !(0 != main_~p6~0#1); 4343#L108-1 assume !(0 != main_~p7~0#1); 3980#L113-1 [2021-12-14 23:12:20,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:20,608 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-12-14 23:12:20,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:20,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785111222] [2021-12-14 23:12:20,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:20,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:20,625 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:12:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:20,634 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:12:20,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:20,636 INFO L85 PathProgramCache]: Analyzing trace with hash 808338756, now seen corresponding path program 1 times [2021-12-14 23:12:20,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:20,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580186876] [2021-12-14 23:12:20,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:20,636 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:20,641 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:12:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:20,653 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:12:20,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:20,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1317176582, now seen corresponding path program 1 times [2021-12-14 23:12:20,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:20,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268721528] [2021-12-14 23:12:20,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:20,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:20,675 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:12:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:20,681 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:12:20,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.12 11:12:20 BoogieIcfgContainer [2021-12-14 23:12:20,925 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-14 23:12:20,925 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 23:12:20,931 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 23:12:20,931 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 23:12:20,932 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:19" (3/4) ... [2021-12-14 23:12:20,933 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-12-14 23:12:20,958 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 23:12:20,959 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 23:12:20,959 INFO L158 Benchmark]: Toolchain (without parser) took 1631.54ms. Allocated memory was 109.1MB in the beginning and 182.5MB in the end (delta: 73.4MB). Free memory was 80.6MB in the beginning and 118.1MB in the end (delta: -37.5MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. [2021-12-14 23:12:20,960 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory was 63.4MB in the beginning and 63.3MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 23:12:20,960 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.57ms. Allocated memory was 109.1MB in the beginning and 182.5MB in the end (delta: 73.4MB). Free memory was 80.3MB in the beginning and 157.3MB in the end (delta: -77.0MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2021-12-14 23:12:20,960 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.82ms. Allocated memory is still 182.5MB. Free memory was 157.3MB in the beginning and 156.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 23:12:20,961 INFO L158 Benchmark]: Boogie Preprocessor took 16.84ms. Allocated memory is still 182.5MB. Free memory was 156.0MB in the beginning and 154.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 23:12:20,961 INFO L158 Benchmark]: RCFGBuilder took 259.21ms. Allocated memory is still 182.5MB. Free memory was 154.6MB in the beginning and 144.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-14 23:12:20,961 INFO L158 Benchmark]: BuchiAutomizer took 1106.41ms. Allocated memory is still 182.5MB. Free memory was 144.2MB in the beginning and 121.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. [2021-12-14 23:12:20,962 INFO L158 Benchmark]: Witness Printer took 33.72ms. Allocated memory is still 182.5MB. Free memory was 121.1MB in the beginning and 118.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 23:12:20,964 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 109.1MB. Free memory was 63.4MB in the beginning and 63.3MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.57ms. Allocated memory was 109.1MB in the beginning and 182.5MB in the end (delta: 73.4MB). Free memory was 80.3MB in the beginning and 157.3MB in the end (delta: -77.0MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.82ms. Allocated memory is still 182.5MB. Free memory was 157.3MB in the beginning and 156.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.84ms. Allocated memory is still 182.5MB. Free memory was 156.0MB in the beginning and 154.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 259.21ms. Allocated memory is still 182.5MB. Free memory was 154.6MB in the beginning and 144.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 1106.41ms. Allocated memory is still 182.5MB. Free memory was 144.2MB in the beginning and 121.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. * Witness Printer took 33.72ms. Allocated memory is still 182.5MB. Free memory was 121.1MB in the beginning and 118.1MB in the end (delta: 3.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 6 terminating modules (6 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.6 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 1282 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.0s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 0.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1282 states and ocurred in iteration 6. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 179 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 179 mSDsluCounter, 558 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 208 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30 IncrementalHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 350 mSDtfsCounter, 30 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI6 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: 32]: 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, NULL=1, cond=4, p5=0, lk2=0, p4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@477e61d3=0, lk6=0, lk1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1ec71dfb=0, p3=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@76b4a4fc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@143eb4ec=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@739ebc0a=0, p7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@ccd6154=0, \result=0, lk7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@61f09402=0, p6=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@67080ada=4, p2=0, lk4=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 32]: 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; [L30] int cond; Loop: [L32] COND TRUE 1 [L33] cond = __VERIFIER_nondet_int() [L34] COND FALSE !(cond == 0) [L37] lk1 = 0 [L39] lk2 = 0 [L41] lk3 = 0 [L43] lk4 = 0 [L45] lk5 = 0 [L47] lk6 = 0 [L49] lk7 = 0 [L53] COND FALSE !(p1 != 0) [L57] COND FALSE !(p2 != 0) [L61] COND FALSE !(p3 != 0) [L65] COND FALSE !(p4 != 0) [L69] COND FALSE !(p5 != 0) [L73] COND FALSE !(p6 != 0) [L77] COND FALSE !(p7 != 0) [L83] COND FALSE !(p1 != 0) [L88] COND FALSE !(p2 != 0) [L93] COND FALSE !(p3 != 0) [L98] COND FALSE !(p4 != 0) [L103] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L113] COND FALSE !(p7 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-12-14 23:12:20,995 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)