./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_8.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 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_8.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 23:12:18,628 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 23:12:18,630 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 23:12:18,687 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 23:12:18,687 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 23:12:18,690 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 23:12:18,691 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 23:12:18,693 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 23:12:18,695 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 23:12:18,699 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 23:12:18,700 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 23:12:18,701 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 23:12:18,701 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 23:12:18,703 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 23:12:18,705 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 23:12:18,708 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 23:12:18,709 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 23:12:18,710 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 23:12:18,711 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 23:12:18,716 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 23:12:18,717 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 23:12:18,717 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 23:12:18,718 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 23:12:18,719 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 23:12:18,721 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 23:12:18,721 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 23:12:18,721 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 23:12:18,722 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 23:12:18,722 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 23:12:18,723 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 23:12:18,723 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 23:12:18,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 23:12:18,725 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 23:12:18,725 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 23:12:18,726 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 23:12:18,727 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 23:12:18,727 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 23:12:18,727 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 23:12:18,728 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 23:12:18,729 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 23:12:18,729 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 23:12:18,730 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,758 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 23:12:18,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 23:12:18,759 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 23:12:18,759 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 23:12:18,760 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 23:12:18,760 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 23:12:18,761 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 23:12:18,761 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-14 23:12:18,761 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-14 23:12:18,761 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-14 23:12:18,762 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-14 23:12:18,762 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-14 23:12:18,762 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-14 23:12:18,762 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 23:12:18,762 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 23:12:18,763 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 23:12:18,763 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 23:12:18,763 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 23:12:18,763 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 23:12:18,763 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-14 23:12:18,763 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-14 23:12:18,763 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-14 23:12:18,764 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 23:12:18,764 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 23:12:18,764 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-14 23:12:18,764 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 23:12:18,764 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-14 23:12:18,764 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 23:12:18,765 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 23:12:18,765 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 23:12:18,765 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 23:12:18,765 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 23:12:18,766 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-14 23:12:18,766 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 -> b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 [2021-12-14 23:12:18,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 23:12:19,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 23:12:19,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 23:12:19,007 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 23:12:19,008 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 23:12:19,009 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_8.c [2021-12-14 23:12:19,063 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0ba0627e/eca5713d9137449bacf8fa9fbd93ad2f/FLAGc780a21f2 [2021-12-14 23:12:19,431 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 23:12:19,432 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_8.c [2021-12-14 23:12:19,440 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0ba0627e/eca5713d9137449bacf8fa9fbd93ad2f/FLAGc780a21f2 [2021-12-14 23:12:19,452 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0ba0627e/eca5713d9137449bacf8fa9fbd93ad2f [2021-12-14 23:12:19,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 23:12:19,457 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 23:12:19,458 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 23:12:19,458 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 23:12:19,460 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 23:12:19,461 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,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d47626e 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,462 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,466 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 23:12:19,482 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 23:12:19,640 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_8.c[3218,3231] [2021-12-14 23:12:19,642 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 23:12:19,649 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 23:12:19,673 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_8.c[3218,3231] [2021-12-14 23:12:19,674 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 23:12:19,686 INFO L208 MainTranslator]: Completed translation [2021-12-14 23:12:19,686 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,687 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 23:12:19,688 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 23:12:19,688 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 23:12:19,688 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 23:12:19,692 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,697 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,715 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 107 [2021-12-14 23:12:19,715 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 23:12:19,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 23:12:19,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 23:12:19,716 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 23:12:19,721 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,721 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,728 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,729 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,739 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,743 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,744 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,746 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 23:12:19,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 23:12:19,749 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 23:12:19,749 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 23:12:19,750 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,755 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:12:19,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:12:19,772 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,780 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,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 23:12:19,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 23:12:19,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 23:12:19,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 23:12:19,849 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 23:12:19,850 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 23:12:19,998 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 23:12:20,002 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 23:12:20,003 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-14 23:12:20,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:12:20 BoogieIcfgContainer [2021-12-14 23:12:20,004 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 23:12:20,005 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-14 23:12:20,005 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-14 23:12:20,007 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-14 23:12:20,008 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:12:20,008 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:20,009 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5178e797 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.12 11:12:20, skipping insertion in model container [2021-12-14 23:12:20,009 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:12:20,009 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:20,009 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5178e797 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.12 11:12:20, skipping insertion in model container [2021-12-14 23:12:20,009 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:12:20,009 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:12:20" (3/3) ... [2021-12-14 23:12:20,010 INFO L388 chiAutomizerObserver]: Analyzing ICFG test_locks_8.c [2021-12-14 23:12:20,036 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-14 23:12:20,037 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-14 23:12:20,037 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-14 23:12:20,037 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-14 23:12:20,038 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-14 23:12:20,038 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-14 23:12:20,038 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-14 23:12:20,038 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-14 23:12:20,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:12:20,072 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2021-12-14 23:12:20,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:12:20,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:12:20,076 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:12:20,077 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:12:20,077 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-14 23:12:20,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:12:20,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2021-12-14 23:12:20,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:12:20,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:12:20,082 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:12:20,082 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:12:20,087 INFO L791 eck$LassoCheckResult]: Stem: 19#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); 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 22#L127-1true [2021-12-14 23:12:20,089 INFO L793 eck$LassoCheckResult]: Loop: 22#L127-1true assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 29#L37true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 7#L58true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 14#L58-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 16#L62-1true assume !(0 != main_~p3~0#1); 30#L66-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 31#L70-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 33#L74-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 27#L78-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 11#L82-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 9#L86-1true assume !(0 != main_~p1~0#1); 6#L92-1true assume !(0 != main_~p2~0#1); 17#L97-1true assume !(0 != main_~p3~0#1); 24#L102-1true assume !(0 != main_~p4~0#1); 21#L107-1true assume !(0 != main_~p5~0#1); 34#L112-1true assume !(0 != main_~p6~0#1); 32#L117-1true assume !(0 != main_~p7~0#1); 12#L122-1true assume !(0 != main_~p8~0#1); 22#L127-1true [2021-12-14 23:12:20,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:20,096 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-14 23:12:20,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:20,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866106712] [2021-12-14 23:12:20,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:20,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:20,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:20,166 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:12:20,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:20,192 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:12:20,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:20,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1098697512, now seen corresponding path program 1 times [2021-12-14 23:12:20,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:20,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078177170] [2021-12-14 23:12:20,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:20,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:20,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:12:20,277 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,278 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:12:20,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078177170] [2021-12-14 23:12:20,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078177170] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:12:20,279 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:12:20,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 23:12:20,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050517770] [2021-12-14 23:12:20,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:12:20,284 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-14 23:12:20,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:12:20,306 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,308 INFO L87 Difference]: Start difference. First operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:12:20,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:12:20,343 INFO L93 Difference]: Finished difference Result 63 states and 106 transitions. [2021-12-14 23:12:20,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:12:20,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 106 transitions. [2021-12-14 23:12:20,354 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2021-12-14 23:12:20,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 53 states and 83 transitions. [2021-12-14 23:12:20,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2021-12-14 23:12:20,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2021-12-14 23:12:20,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 83 transitions. [2021-12-14 23:12:20,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:12:20,360 INFO L681 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2021-12-14 23:12:20,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 83 transitions. [2021-12-14 23:12:20,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-12-14 23:12:20,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.5660377358490567) internal successors, (83), 52 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:12:20,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 83 transitions. [2021-12-14 23:12:20,392 INFO L704 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2021-12-14 23:12:20,393 INFO L587 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2021-12-14 23:12:20,393 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-14 23:12:20,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 83 transitions. [2021-12-14 23:12:20,393 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2021-12-14 23:12:20,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:12:20,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:12:20,394 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:12:20,394 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:12:20,394 INFO L791 eck$LassoCheckResult]: Stem: 125#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); 112#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 113#L127-1 [2021-12-14 23:12:20,394 INFO L793 eck$LassoCheckResult]: Loop: 113#L127-1 assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 140#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 138#L58 assume !(0 != main_~p1~0#1); 139#L58-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 157#L62-1 assume !(0 != main_~p3~0#1); 156#L66-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 155#L70-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 154#L74-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 153#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 152#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 151#L86-1 assume !(0 != main_~p1~0#1); 109#L92-1 assume !(0 != main_~p2~0#1); 108#L97-1 assume !(0 != main_~p3~0#1); 123#L102-1 assume !(0 != main_~p4~0#1); 129#L107-1 assume !(0 != main_~p5~0#1); 143#L112-1 assume !(0 != main_~p6~0#1); 137#L117-1 assume !(0 != main_~p7~0#1); 131#L122-1 assume !(0 != main_~p8~0#1); 113#L127-1 [2021-12-14 23:12:20,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:20,395 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-12-14 23:12:20,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:20,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919624377] [2021-12-14 23:12:20,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:20,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:20,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:20,411 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:12:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:20,416 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:12:20,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:20,417 INFO L85 PathProgramCache]: Analyzing trace with hash 77629158, now seen corresponding path program 1 times [2021-12-14 23:12:20,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:20,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847888349] [2021-12-14 23:12:20,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:20,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:20,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:12:20,436 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,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:12:20,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847888349] [2021-12-14 23:12:20,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847888349] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:12:20,438 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:12:20,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 23:12:20,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742366912] [2021-12-14 23:12:20,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:12:20,439 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-14 23:12:20,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:12:20,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:12:20,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:12:20,441 INFO L87 Difference]: Start difference. First operand 53 states and 83 transitions. cyclomatic complexity: 32 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:12:20,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:12:20,466 INFO L93 Difference]: Finished difference Result 102 states and 158 transitions. [2021-12-14 23:12:20,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:12:20,467 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 158 transitions. [2021-12-14 23:12:20,469 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 100 [2021-12-14 23:12:20,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 102 states and 158 transitions. [2021-12-14 23:12:20,470 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2021-12-14 23:12:20,470 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2021-12-14 23:12:20,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 158 transitions. [2021-12-14 23:12:20,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:12:20,471 INFO L681 BuchiCegarLoop]: Abstraction has 102 states and 158 transitions. [2021-12-14 23:12:20,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 158 transitions. [2021-12-14 23:12:20,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2021-12-14 23:12:20,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 102 states have (on average 1.5490196078431373) internal successors, (158), 101 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:12:20,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 158 transitions. [2021-12-14 23:12:20,479 INFO L704 BuchiCegarLoop]: Abstraction has 102 states and 158 transitions. [2021-12-14 23:12:20,479 INFO L587 BuchiCegarLoop]: Abstraction has 102 states and 158 transitions. [2021-12-14 23:12:20,479 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-14 23:12:20,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 158 transitions. [2021-12-14 23:12:20,480 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 100 [2021-12-14 23:12:20,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:12:20,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:12:20,481 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:12:20,481 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:12:20,481 INFO L791 eck$LassoCheckResult]: Stem: 289#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); 273#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 274#L127-1 [2021-12-14 23:12:20,481 INFO L793 eck$LassoCheckResult]: Loop: 274#L127-1 assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 325#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 323#L58 assume !(0 != main_~p1~0#1); 320#L58-2 assume !(0 != main_~p2~0#1); 318#L62-1 assume !(0 != main_~p3~0#1); 316#L66-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 314#L70-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 312#L74-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 310#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 308#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 306#L86-1 assume !(0 != main_~p1~0#1); 307#L92-1 assume !(0 != main_~p2~0#1); 348#L97-1 assume !(0 != main_~p3~0#1); 345#L102-1 assume !(0 != main_~p4~0#1); 341#L107-1 assume !(0 != main_~p5~0#1); 336#L112-1 assume !(0 != main_~p6~0#1); 333#L117-1 assume !(0 != main_~p7~0#1); 329#L122-1 assume !(0 != main_~p8~0#1); 274#L127-1 [2021-12-14 23:12:20,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:20,482 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-12-14 23:12:20,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:20,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049839483] [2021-12-14 23:12:20,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:20,482 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,491 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,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:20,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1202234520, 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,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331803971] [2021-12-14 23:12:20,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:20,494 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:12:20,510 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,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:12:20,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331803971] [2021-12-14 23:12:20,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331803971] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:12:20,510 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:12:20,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 23:12:20,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736845505] [2021-12-14 23:12:20,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:12:20,511 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-14 23:12:20,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:12:20,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:12:20,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:12:20,512 INFO L87 Difference]: Start difference. First operand 102 states and 158 transitions. cyclomatic complexity: 60 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:12:20,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:12:20,521 INFO L93 Difference]: Finished difference Result 198 states and 302 transitions. [2021-12-14 23:12:20,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:12:20,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 198 states and 302 transitions. [2021-12-14 23:12:20,524 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 196 [2021-12-14 23:12:20,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 198 states to 198 states and 302 transitions. [2021-12-14 23:12:20,525 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 198 [2021-12-14 23:12:20,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 198 [2021-12-14 23:12:20,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 198 states and 302 transitions. [2021-12-14 23:12:20,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:12:20,527 INFO L681 BuchiCegarLoop]: Abstraction has 198 states and 302 transitions. [2021-12-14 23:12:20,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states and 302 transitions. [2021-12-14 23:12:20,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-12-14 23:12:20,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 198 states have (on average 1.5252525252525253) internal successors, (302), 197 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:12:20,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 302 transitions. [2021-12-14 23:12:20,536 INFO L704 BuchiCegarLoop]: Abstraction has 198 states and 302 transitions. [2021-12-14 23:12:20,536 INFO L587 BuchiCegarLoop]: Abstraction has 198 states and 302 transitions. [2021-12-14 23:12:20,536 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-14 23:12:20,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 198 states and 302 transitions. [2021-12-14 23:12:20,537 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 196 [2021-12-14 23:12:20,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:12:20,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:12:20,538 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:12:20,538 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:12:20,538 INFO L791 eck$LassoCheckResult]: Stem: 597#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); 580#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 581#L127-1 [2021-12-14 23:12:20,538 INFO L793 eck$LassoCheckResult]: Loop: 581#L127-1 assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 645#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 638#L58 assume !(0 != main_~p1~0#1); 639#L58-2 assume !(0 != main_~p2~0#1); 630#L62-1 assume !(0 != main_~p3~0#1); 631#L66-1 assume !(0 != main_~p4~0#1); 701#L70-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 700#L74-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 699#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 698#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 697#L86-1 assume !(0 != main_~p1~0#1); 694#L92-1 assume !(0 != main_~p2~0#1); 690#L97-1 assume !(0 != main_~p3~0#1); 688#L102-1 assume !(0 != main_~p4~0#1); 676#L107-1 assume !(0 != main_~p5~0#1); 675#L112-1 assume !(0 != main_~p6~0#1); 655#L117-1 assume !(0 != main_~p7~0#1); 654#L122-1 assume !(0 != main_~p8~0#1); 581#L127-1 [2021-12-14 23:12:20,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:20,539 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-12-14 23:12:20,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:20,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975149341] [2021-12-14 23:12:20,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:20,539 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:20,543 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:12:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:20,546 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:12:20,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:20,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1789040534, now seen corresponding path program 1 times [2021-12-14 23:12:20,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:20,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992890346] [2021-12-14 23:12:20,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:20,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:12:20,562 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,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:12:20,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992890346] [2021-12-14 23:12:20,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992890346] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:12:20,563 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:12:20,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 23:12:20,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020957040] [2021-12-14 23:12:20,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:12:20,563 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-14 23:12:20,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:12:20,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:12:20,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:12:20,564 INFO L87 Difference]: Start difference. First operand 198 states and 302 transitions. cyclomatic complexity: 112 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:12:20,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:12:20,573 INFO L93 Difference]: Finished difference Result 386 states and 578 transitions. [2021-12-14 23:12:20,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:12:20,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 386 states and 578 transitions. [2021-12-14 23:12:20,576 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 384 [2021-12-14 23:12:20,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 386 states to 386 states and 578 transitions. [2021-12-14 23:12:20,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 386 [2021-12-14 23:12:20,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 386 [2021-12-14 23:12:20,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 386 states and 578 transitions. [2021-12-14 23:12:20,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:12:20,580 INFO L681 BuchiCegarLoop]: Abstraction has 386 states and 578 transitions. [2021-12-14 23:12:20,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states and 578 transitions. [2021-12-14 23:12:20,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2021-12-14 23:12:20,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 386 states have (on average 1.4974093264248705) internal successors, (578), 385 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:12:20,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 578 transitions. [2021-12-14 23:12:20,593 INFO L704 BuchiCegarLoop]: Abstraction has 386 states and 578 transitions. [2021-12-14 23:12:20,593 INFO L587 BuchiCegarLoop]: Abstraction has 386 states and 578 transitions. [2021-12-14 23:12:20,593 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-14 23:12:20,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 386 states and 578 transitions. [2021-12-14 23:12:20,594 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 384 [2021-12-14 23:12:20,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:12:20,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:12:20,595 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:12:20,595 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:12:20,595 INFO L791 eck$LassoCheckResult]: Stem: 1186#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); 1169#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 1170#L127-1 [2021-12-14 23:12:20,595 INFO L793 eck$LassoCheckResult]: Loop: 1170#L127-1 assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 1273#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 1266#L58 assume !(0 != main_~p1~0#1); 1268#L58-2 assume !(0 != main_~p2~0#1); 1246#L62-1 assume !(0 != main_~p3~0#1); 1247#L66-1 assume !(0 != main_~p4~0#1); 1335#L70-1 assume !(0 != main_~p5~0#1); 1330#L74-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1331#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1322#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1323#L86-1 assume !(0 != main_~p1~0#1); 1359#L92-1 assume !(0 != main_~p2~0#1); 1357#L97-1 assume !(0 != main_~p3~0#1); 1355#L102-1 assume !(0 != main_~p4~0#1); 1354#L107-1 assume !(0 != main_~p5~0#1); 1352#L112-1 assume !(0 != main_~p6~0#1); 1351#L117-1 assume !(0 != main_~p7~0#1); 1287#L122-1 assume !(0 != main_~p8~0#1); 1170#L127-1 [2021-12-14 23:12:20,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:20,596 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-12-14 23:12:20,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:20,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039324042] [2021-12-14 23:12:20,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:20,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:20,600 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:12:20,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:20,603 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:12:20,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:20,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1530875096, now seen corresponding path program 1 times [2021-12-14 23:12:20,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:20,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562249876] [2021-12-14 23:12:20,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:20,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:12:20,619 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,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:12:20,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562249876] [2021-12-14 23:12:20,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562249876] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:12:20,619 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:12:20,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 23:12:20,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814013995] [2021-12-14 23:12:20,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:12:20,620 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-14 23:12:20,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:12:20,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:12:20,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:12:20,621 INFO L87 Difference]: Start difference. First operand 386 states and 578 transitions. cyclomatic complexity: 208 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:12:20,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:12:20,630 INFO L93 Difference]: Finished difference Result 754 states and 1106 transitions. [2021-12-14 23:12:20,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:12:20,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 754 states and 1106 transitions. [2021-12-14 23:12:20,636 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 752 [2021-12-14 23:12:20,646 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 754 states to 754 states and 1106 transitions. [2021-12-14 23:12:20,646 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 754 [2021-12-14 23:12:20,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 754 [2021-12-14 23:12:20,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 754 states and 1106 transitions. [2021-12-14 23:12:20,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:12:20,648 INFO L681 BuchiCegarLoop]: Abstraction has 754 states and 1106 transitions. [2021-12-14 23:12:20,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states and 1106 transitions. [2021-12-14 23:12:20,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2021-12-14 23:12:20,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 754 states have (on average 1.46684350132626) internal successors, (1106), 753 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:12:20,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1106 transitions. [2021-12-14 23:12:20,664 INFO L704 BuchiCegarLoop]: Abstraction has 754 states and 1106 transitions. [2021-12-14 23:12:20,664 INFO L587 BuchiCegarLoop]: Abstraction has 754 states and 1106 transitions. [2021-12-14 23:12:20,664 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-14 23:12:20,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 754 states and 1106 transitions. [2021-12-14 23:12:20,673 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 752 [2021-12-14 23:12:20,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:12:20,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:12:20,674 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:12:20,674 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:12:20,674 INFO L791 eck$LassoCheckResult]: Stem: 2329#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); 2315#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 2316#L127-1 [2021-12-14 23:12:20,674 INFO L793 eck$LassoCheckResult]: Loop: 2316#L127-1 assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 2415#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 2411#L58 assume !(0 != main_~p1~0#1); 2408#L58-2 assume !(0 != main_~p2~0#1); 2406#L62-1 assume !(0 != main_~p3~0#1); 2403#L66-1 assume !(0 != main_~p4~0#1); 2399#L70-1 assume !(0 != main_~p5~0#1); 2396#L74-1 assume !(0 != main_~p6~0#1); 2394#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2391#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2387#L86-1 assume !(0 != main_~p1~0#1); 2385#L92-1 assume !(0 != main_~p2~0#1); 2381#L97-1 assume !(0 != main_~p3~0#1); 2378#L102-1 assume !(0 != main_~p4~0#1); 2379#L107-1 assume !(0 != main_~p5~0#1); 2426#L112-1 assume !(0 != main_~p6~0#1); 2423#L117-1 assume !(0 != main_~p7~0#1); 2420#L122-1 assume !(0 != main_~p8~0#1); 2316#L127-1 [2021-12-14 23:12:20,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:20,675 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-12-14 23:12:20,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:20,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754726810] [2021-12-14 23:12:20,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:20,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:20,679 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:12:20,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:20,682 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:12:20,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:20,682 INFO L85 PathProgramCache]: Analyzing trace with hash -829810518, now seen corresponding path program 1 times [2021-12-14 23:12:20,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:20,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269340312] [2021-12-14 23:12:20,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:20,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:20,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:12:20,697 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,697 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:12:20,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269340312] [2021-12-14 23:12:20,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269340312] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:12:20,698 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:12:20,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 23:12:20,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123466205] [2021-12-14 23:12:20,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:12:20,698 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-14 23:12:20,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:12:20,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:12:20,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:12:20,699 INFO L87 Difference]: Start difference. First operand 754 states and 1106 transitions. cyclomatic complexity: 384 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:12:20,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:12:20,709 INFO L93 Difference]: Finished difference Result 1474 states and 2114 transitions. [2021-12-14 23:12:20,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:12:20,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1474 states and 2114 transitions. [2021-12-14 23:12:20,718 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1472 [2021-12-14 23:12:20,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1474 states to 1474 states and 2114 transitions. [2021-12-14 23:12:20,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1474 [2021-12-14 23:12:20,727 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1474 [2021-12-14 23:12:20,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1474 states and 2114 transitions. [2021-12-14 23:12:20,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:12:20,729 INFO L681 BuchiCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2021-12-14 23:12:20,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states and 2114 transitions. [2021-12-14 23:12:20,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1474. [2021-12-14 23:12:20,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1474 states have (on average 1.4341926729986432) internal successors, (2114), 1473 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:12:20,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2114 transitions. [2021-12-14 23:12:20,749 INFO L704 BuchiCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2021-12-14 23:12:20,749 INFO L587 BuchiCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2021-12-14 23:12:20,750 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-14 23:12:20,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1474 states and 2114 transitions. [2021-12-14 23:12:20,755 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1472 [2021-12-14 23:12:20,756 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:12:20,756 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:12:20,756 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:12:20,756 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:12:20,756 INFO L791 eck$LassoCheckResult]: Stem: 4564#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); 4550#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 4551#L127-1 [2021-12-14 23:12:20,757 INFO L793 eck$LassoCheckResult]: Loop: 4551#L127-1 assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 4806#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 4807#L58 assume !(0 != main_~p1~0#1); 4818#L58-2 assume !(0 != main_~p2~0#1); 4816#L62-1 assume !(0 != main_~p3~0#1); 4812#L66-1 assume !(0 != main_~p4~0#1); 4809#L70-1 assume !(0 != main_~p5~0#1); 4770#L74-1 assume !(0 != main_~p6~0#1); 4767#L78-1 assume !(0 != main_~p7~0#1); 4765#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4730#L86-1 assume !(0 != main_~p1~0#1); 4724#L92-1 assume !(0 != main_~p2~0#1); 4725#L97-1 assume !(0 != main_~p3~0#1); 4711#L102-1 assume !(0 != main_~p4~0#1); 4713#L107-1 assume !(0 != main_~p5~0#1); 4831#L112-1 assume !(0 != main_~p6~0#1); 4827#L117-1 assume !(0 != main_~p7~0#1); 4824#L122-1 assume !(0 != main_~p8~0#1); 4551#L127-1 [2021-12-14 23:12:20,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:20,757 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-12-14 23:12:20,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:20,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294718030] [2021-12-14 23:12:20,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:20,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:20,767 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:12:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:20,776 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:12:20,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:20,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1222837528, now seen corresponding path program 1 times [2021-12-14 23:12:20,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:20,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96892241] [2021-12-14 23:12:20,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:20,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:12:20,801 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,802 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:12:20,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96892241] [2021-12-14 23:12:20,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96892241] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:12:20,803 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:12:20,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 23:12:20,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325846797] [2021-12-14 23:12:20,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:12:20,803 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-14 23:12:20,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:12:20,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:12:20,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:12:20,804 INFO L87 Difference]: Start difference. First operand 1474 states and 2114 transitions. cyclomatic complexity: 704 Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:12:20,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:12:20,826 INFO L93 Difference]: Finished difference Result 2882 states and 4034 transitions. [2021-12-14 23:12:20,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:12:20,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2882 states and 4034 transitions. [2021-12-14 23:12:20,844 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 2880 [2021-12-14 23:12:20,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2882 states to 2882 states and 4034 transitions. [2021-12-14 23:12:20,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2882 [2021-12-14 23:12:20,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2882 [2021-12-14 23:12:20,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2882 states and 4034 transitions. [2021-12-14 23:12:20,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:12:20,859 INFO L681 BuchiCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2021-12-14 23:12:20,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states and 4034 transitions. [2021-12-14 23:12:20,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2882. [2021-12-14 23:12:20,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2882 states, 2882 states have (on average 1.3997224149895906) internal successors, (4034), 2881 states have internal predecessors, (4034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:12:20,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2882 states and 4034 transitions. [2021-12-14 23:12:20,914 INFO L704 BuchiCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2021-12-14 23:12:20,914 INFO L587 BuchiCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2021-12-14 23:12:20,914 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-14 23:12:20,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2882 states and 4034 transitions. [2021-12-14 23:12:20,924 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 2880 [2021-12-14 23:12:20,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:12:20,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:12:20,924 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:12:20,925 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:12:20,925 INFO L791 eck$LassoCheckResult]: Stem: 8925#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); 8910#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 8911#L127-1 [2021-12-14 23:12:20,925 INFO L793 eck$LassoCheckResult]: Loop: 8911#L127-1 assume !false;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 9035#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 9033#L58 assume !(0 != main_~p1~0#1); 9027#L58-2 assume !(0 != main_~p2~0#1); 9029#L62-1 assume !(0 != main_~p3~0#1); 9017#L66-1 assume !(0 != main_~p4~0#1); 9019#L70-1 assume !(0 != main_~p5~0#1); 9005#L74-1 assume !(0 != main_~p6~0#1); 9007#L78-1 assume !(0 != main_~p7~0#1); 8993#L82-1 assume !(0 != main_~p8~0#1); 8995#L86-1 assume !(0 != main_~p1~0#1); 9058#L92-1 assume !(0 != main_~p2~0#1); 9056#L97-1 assume !(0 != main_~p3~0#1); 9053#L102-1 assume !(0 != main_~p4~0#1); 9051#L107-1 assume !(0 != main_~p5~0#1); 9047#L112-1 assume !(0 != main_~p6~0#1); 9043#L117-1 assume !(0 != main_~p7~0#1); 9039#L122-1 assume !(0 != main_~p8~0#1); 8911#L127-1 [2021-12-14 23:12:20,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:20,925 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-12-14 23:12:20,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:20,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165957163] [2021-12-14 23:12:20,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:20,926 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:20,939 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:12:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:20,943 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:12:20,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:20,943 INFO L85 PathProgramCache]: Analyzing trace with hash -542779158, now seen corresponding path program 1 times [2021-12-14 23:12:20,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:20,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904514018] [2021-12-14 23:12:20,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:20,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:20,947 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:12:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:20,952 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:12:20,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:12:20,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1175900116, now seen corresponding path program 1 times [2021-12-14 23:12:20,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:12:20,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935801811] [2021-12-14 23:12:20,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:12:20,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:12:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:20,957 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:12:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:12:20,962 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:12:21,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.12 11:12:21 BoogieIcfgContainer [2021-12-14 23:12:21,148 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-14 23:12:21,148 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 23:12:21,149 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 23:12:21,149 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 23:12:21,149 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:20" (3/4) ... [2021-12-14 23:12:21,151 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-12-14 23:12:21,176 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 23:12:21,179 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 23:12:21,179 INFO L158 Benchmark]: Toolchain (without parser) took 1722.65ms. Allocated memory was 117.4MB in the beginning and 148.9MB in the end (delta: 31.5MB). Free memory was 86.0MB in the beginning and 84.7MB in the end (delta: 1.4MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. [2021-12-14 23:12:21,180 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory was 41.6MB in the beginning and 41.5MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 23:12:21,180 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.74ms. Allocated memory is still 117.4MB. Free memory was 85.8MB in the beginning and 93.6MB in the end (delta: -7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 23:12:21,180 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.68ms. Allocated memory is still 117.4MB. Free memory was 93.6MB in the beginning and 91.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 23:12:21,180 INFO L158 Benchmark]: Boogie Preprocessor took 31.82ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 91.0MB in the end (delta: 908.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 23:12:21,180 INFO L158 Benchmark]: RCFGBuilder took 256.02ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 80.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-14 23:12:21,181 INFO L158 Benchmark]: BuchiAutomizer took 1143.22ms. Allocated memory was 117.4MB in the beginning and 148.9MB in the end (delta: 31.5MB). Free memory was 80.1MB in the beginning and 86.7MB in the end (delta: -6.6MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2021-12-14 23:12:21,181 INFO L158 Benchmark]: Witness Printer took 30.44ms. Allocated memory is still 148.9MB. Free memory was 86.7MB in the beginning and 84.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 23:12:21,182 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 83.9MB. Free memory was 41.6MB in the beginning and 41.5MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.74ms. Allocated memory is still 117.4MB. Free memory was 85.8MB in the beginning and 93.6MB in the end (delta: -7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.68ms. Allocated memory is still 117.4MB. Free memory was 93.6MB in the beginning and 91.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.82ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 91.0MB in the end (delta: 908.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 256.02ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 80.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 1143.22ms. Allocated memory was 117.4MB in the beginning and 148.9MB in the end (delta: 31.5MB). Free memory was 80.1MB in the beginning and 86.7MB in the end (delta: -6.6MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. * Witness Printer took 30.44ms. Allocated memory is still 148.9MB. Free memory was 86.7MB in the beginning and 84.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 2882 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.1s and 8 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 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 2882 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 236 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 236 mSDsluCounter, 736 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 277 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35 IncrementalHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 459 mSDtfsCounter, 35 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI7 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 35]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {lk5=0, p1=0, NULL=0, NULL=1, cond=4, p5=0, lk2=0, p4=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@714661b1=0, lk6=0, lk1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@16207b1=0, p3=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@224ed902=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@25942ac8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@567b296c=0, p7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@68b365fe=0, \result=0, lk7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6b717fd7=4, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6088bfa7=0, p6=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6f37da93=0, p2=0, lk4=0, lk8=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 35]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L33] int cond; Loop: [L35] COND TRUE 1 [L36] cond = __VERIFIER_nondet_int() [L37] COND FALSE !(cond == 0) [L40] lk1 = 0 [L42] lk2 = 0 [L44] lk3 = 0 [L46] lk4 = 0 [L48] lk5 = 0 [L50] lk6 = 0 [L52] lk7 = 0 [L54] lk8 = 0 [L58] COND FALSE !(p1 != 0) [L62] COND FALSE !(p2 != 0) [L66] COND FALSE !(p3 != 0) [L70] COND FALSE !(p4 != 0) [L74] COND FALSE !(p5 != 0) [L78] COND FALSE !(p6 != 0) [L82] COND FALSE !(p7 != 0) [L86] COND FALSE !(p8 != 0) [L92] COND FALSE !(p1 != 0) [L97] COND FALSE !(p2 != 0) [L102] COND FALSE !(p3 != 0) [L107] COND FALSE !(p4 != 0) [L112] COND FALSE !(p5 != 0) [L117] COND FALSE !(p6 != 0) [L122] COND FALSE !(p7 != 0) [L127] COND FALSE !(p8 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-12-14 23:12:21,211 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)