./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_15-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f4b24e32 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_15-1.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 11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 15:10:58,653 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 15:10:58,655 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 15:10:58,674 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 15:10:58,675 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 15:10:58,676 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 15:10:58,677 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 15:10:58,678 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 15:10:58,679 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 15:10:58,680 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 15:10:58,681 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 15:10:58,681 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 15:10:58,682 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 15:10:58,682 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 15:10:58,683 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 15:10:58,684 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 15:10:58,684 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 15:10:58,685 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 15:10:58,686 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 15:10:58,687 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 15:10:58,688 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 15:10:58,689 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 15:10:58,690 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 15:10:58,690 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 15:10:58,691 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 15:10:58,693 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 15:10:58,693 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 15:10:58,693 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 15:10:58,694 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 15:10:58,694 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 15:10:58,695 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 15:10:58,695 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 15:10:58,696 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 15:10:58,696 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 15:10:58,697 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 15:10:58,697 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 15:10:58,698 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 15:10:58,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 15:10:58,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 15:10:58,699 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 15:10:58,699 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 15:10:58,700 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 15:10:58,700 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-14 15:10:58,715 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 15:10:58,715 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 15:10:58,716 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 15:10:58,716 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 15:10:58,717 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 15:10:58,717 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 15:10:58,717 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 15:10:58,717 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 15:10:58,717 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 15:10:58,718 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 15:10:58,718 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 15:10:58,718 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 15:10:58,718 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 15:10:58,718 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 15:10:58,719 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 15:10:58,719 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 15:10:58,719 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 15:10:58,719 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 15:10:58,719 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 15:10:58,719 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 15:10:58,720 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 15:10:58,720 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 15:10:58,720 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 15:10:58,720 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 15:10:58,720 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 15:10:58,721 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 15:10:58,721 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 15:10:58,721 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 15:10:58,721 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 15:10:58,721 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 15:10:58,721 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 15:10:58,722 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 15:10:58,722 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 -> 11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0 [2022-07-14 15:10:58,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 15:10:58,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 15:10:58,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 15:10:58,946 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 15:10:58,947 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 15:10:58,947 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_15-1.c [2022-07-14 15:10:59,011 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8a1ae6ee/184b76f50ff54a848026f80e4967a2bc/FLAG0ca5871b2 [2022-07-14 15:10:59,306 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 15:10:59,306 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-1.c [2022-07-14 15:10:59,311 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8a1ae6ee/184b76f50ff54a848026f80e4967a2bc/FLAG0ca5871b2 [2022-07-14 15:10:59,733 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8a1ae6ee/184b76f50ff54a848026f80e4967a2bc [2022-07-14 15:10:59,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 15:10:59,736 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 15:10:59,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 15:10:59,738 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 15:10:59,745 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 15:10:59,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:10:59" (1/1) ... [2022-07-14 15:10:59,746 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ec0e54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:10:59, skipping insertion in model container [2022-07-14 15:10:59,747 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:10:59" (1/1) ... [2022-07-14 15:10:59,751 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 15:10:59,788 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 15:10:59,922 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_15-1.c[5654,5667] [2022-07-14 15:10:59,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:10:59,929 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 15:10:59,945 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_15-1.c[5654,5667] [2022-07-14 15:10:59,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:10:59,955 INFO L208 MainTranslator]: Completed translation [2022-07-14 15:10:59,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:10:59 WrapperNode [2022-07-14 15:10:59,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 15:10:59,957 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 15:10:59,957 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 15:10:59,957 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 15:10:59,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:10:59" (1/1) ... [2022-07-14 15:10:59,967 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:10:59" (1/1) ... [2022-07-14 15:10:59,982 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 179 [2022-07-14 15:10:59,984 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 15:10:59,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 15:10:59,985 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 15:10:59,985 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 15:10:59,991 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:10:59" (1/1) ... [2022-07-14 15:10:59,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:10:59" (1/1) ... [2022-07-14 15:11:00,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:10:59" (1/1) ... [2022-07-14 15:11:00,008 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:10:59" (1/1) ... [2022-07-14 15:11:00,011 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:10:59" (1/1) ... [2022-07-14 15:11:00,022 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:10:59" (1/1) ... [2022-07-14 15:11:00,023 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:10:59" (1/1) ... [2022-07-14 15:11:00,033 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 15:11:00,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 15:11:00,034 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 15:11:00,034 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 15:11:00,035 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:10:59" (1/1) ... [2022-07-14 15:11:00,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:11:00,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:11:00,064 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:11:00,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-14 15:11:00,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 15:11:00,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 15:11:00,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 15:11:00,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 15:11:00,142 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 15:11:00,143 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 15:11:00,308 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 15:11:00,312 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 15:11:00,313 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-14 15:11:00,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:11:00 BoogieIcfgContainer [2022-07-14 15:11:00,314 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 15:11:00,315 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 15:11:00,324 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 15:11:00,327 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 15:11:00,329 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:11:00,329 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 03:10:59" (1/3) ... [2022-07-14 15:11:00,330 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3bcd46d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:11:00, skipping insertion in model container [2022-07-14 15:11:00,330 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:11:00,330 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:10:59" (2/3) ... [2022-07-14 15:11:00,330 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3bcd46d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:11:00, skipping insertion in model container [2022-07-14 15:11:00,331 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:11:00,331 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:11:00" (3/3) ... [2022-07-14 15:11:00,332 INFO L354 chiAutomizerObserver]: Analyzing ICFG test_locks_15-1.c [2022-07-14 15:11:00,366 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 15:11:00,366 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 15:11:00,366 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 15:11:00,367 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 15:11:00,367 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 15:11:00,367 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 15:11:00,367 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 15:11:00,367 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 15:11:00,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 53 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:11:00,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2022-07-14 15:11:00,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:11:00,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:11:00,403 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:11:00,403 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:11:00,403 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 15:11:00,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 53 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:11:00,410 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2022-07-14 15:11:00,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:11:00,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:11:00,416 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:11:00,416 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:11:00,422 INFO L752 eck$LassoCheckResult]: Stem: 42#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(18, 2);call #Ultimate.allocInit(12, 3); 33#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 21#L225-1true [2022-07-14 15:11:00,428 INFO L754 eck$LassoCheckResult]: Loop: 21#L225-1true assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 32#L58true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 28#L93true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 26#L93-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 13#L97-1true assume !(0 != main_~p3~0#1); 16#L101-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 49#L105-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 44#L109-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 12#L113-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 23#L117-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 30#L121-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 17#L125-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 35#L129-1true assume !(0 != main_~p11~0#1); 3#L133-1true assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 6#L137-1true assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 39#L141-1true assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 54#L145-1true assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 47#L149-1true assume !(0 != main_~p1~0#1); 46#L155-1true assume 0 != main_~p2~0#1; 8#L161true assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 19#L160true assume !(0 != main_~p3~0#1); 11#L165-1true assume !(0 != main_~p4~0#1); 41#L170-1true assume !(0 != main_~p5~0#1); 45#L175-1true assume !(0 != main_~p6~0#1); 18#L180-1true assume !(0 != main_~p7~0#1); 38#L185-1true assume !(0 != main_~p8~0#1); 25#L190-1true assume !(0 != main_~p9~0#1); 40#L195-1true assume !(0 != main_~p10~0#1); 15#L200-1true assume !(0 != main_~p11~0#1); 43#L205-1true assume !(0 != main_~p12~0#1); 24#L210-1true assume !(0 != main_~p13~0#1); 5#L215-1true assume 0 != main_~p14~0#1; 14#L221true assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 53#L220true assume !(0 != main_~p15~0#1); 21#L225-1true [2022-07-14 15:11:00,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:11:00,437 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-14 15:11:00,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:11:00,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178452006] [2022-07-14 15:11:00,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:11:00,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:11:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:00,523 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:11:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:00,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:11:00,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:11:00,558 INFO L85 PathProgramCache]: Analyzing trace with hash -638858682, now seen corresponding path program 1 times [2022-07-14 15:11:00,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:11:00,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526630645] [2022-07-14 15:11:00,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:11:00,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:11:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:11:00,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:11:00,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:11:00,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526630645] [2022-07-14 15:11:00,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526630645] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:11:00,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:11:00,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:11:00,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891033777] [2022-07-14 15:11:00,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:11:00,651 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:11:00,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:11:00,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:11:00,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:11:00,673 INFO L87 Difference]: Start difference. First operand has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 53 states have internal predecessors, (101), 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 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:11:00,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:11:00,697 INFO L93 Difference]: Finished difference Result 105 states and 190 transitions. [2022-07-14 15:11:00,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:11:00,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 190 transitions. [2022-07-14 15:11:00,703 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2022-07-14 15:11:00,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 95 states and 149 transitions. [2022-07-14 15:11:00,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2022-07-14 15:11:00,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2022-07-14 15:11:00,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 149 transitions. [2022-07-14 15:11:00,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:11:00,708 INFO L369 hiAutomatonCegarLoop]: Abstraction has 95 states and 149 transitions. [2022-07-14 15:11:00,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 149 transitions. [2022-07-14 15:11:00,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-07-14 15:11:00,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.568421052631579) internal successors, (149), 94 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:11:00,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 149 transitions. [2022-07-14 15:11:00,729 INFO L392 hiAutomatonCegarLoop]: Abstraction has 95 states and 149 transitions. [2022-07-14 15:11:00,729 INFO L374 stractBuchiCegarLoop]: Abstraction has 95 states and 149 transitions. [2022-07-14 15:11:00,729 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 15:11:00,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 149 transitions. [2022-07-14 15:11:00,731 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2022-07-14 15:11:00,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:11:00,731 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:11:00,732 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:11:00,732 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:11:00,732 INFO L752 eck$LassoCheckResult]: Stem: 218#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(18, 2);call #Ultimate.allocInit(12, 3); 212#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 174#L225-1 [2022-07-14 15:11:00,732 INFO L754 eck$LassoCheckResult]: Loop: 174#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 210#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 211#L93 assume !(0 != main_~p1~0#1); 206#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 186#L97-1 assume !(0 != main_~p3~0#1); 187#L101-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 191#L105-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 220#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 182#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 183#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 201#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 192#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 193#L129-1 assume !(0 != main_~p11~0#1); 168#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 169#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 172#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 215#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 226#L149-1 assume !(0 != main_~p1~0#1); 227#L155-1 assume 0 != main_~p2~0#1; 262#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 261#L160 assume !(0 != main_~p3~0#1); 259#L165-1 assume !(0 != main_~p4~0#1); 256#L170-1 assume !(0 != main_~p5~0#1); 255#L175-1 assume !(0 != main_~p6~0#1); 253#L180-1 assume !(0 != main_~p7~0#1); 250#L185-1 assume !(0 != main_~p8~0#1); 249#L190-1 assume !(0 != main_~p9~0#1); 216#L195-1 assume !(0 != main_~p10~0#1); 188#L200-1 assume !(0 != main_~p11~0#1); 189#L205-1 assume !(0 != main_~p12~0#1); 241#L210-1 assume !(0 != main_~p13~0#1); 239#L215-1 assume 0 != main_~p14~0#1; 184#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 185#L220 assume !(0 != main_~p15~0#1); 174#L225-1 [2022-07-14 15:11:00,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:11:00,733 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-14 15:11:00,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:11:00,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21448736] [2022-07-14 15:11:00,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:11:00,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:11:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:00,739 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:11:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:00,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:11:00,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:11:00,744 INFO L85 PathProgramCache]: Analyzing trace with hash -364099068, now seen corresponding path program 1 times [2022-07-14 15:11:00,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:11:00,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951083598] [2022-07-14 15:11:00,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:11:00,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:11:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:11:00,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:11:00,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:11:00,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951083598] [2022-07-14 15:11:00,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951083598] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:11:00,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:11:00,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:11:00,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778791489] [2022-07-14 15:11:00,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:11:00,773 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:11:00,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:11:00,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:11:00,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:11:00,774 INFO L87 Difference]: Start difference. First operand 95 states and 149 transitions. cyclomatic complexity: 56 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:11:00,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:11:00,788 INFO L93 Difference]: Finished difference Result 186 states and 290 transitions. [2022-07-14 15:11:00,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:11:00,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 290 transitions. [2022-07-14 15:11:00,801 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2022-07-14 15:11:00,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 186 states and 290 transitions. [2022-07-14 15:11:00,803 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 186 [2022-07-14 15:11:00,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 186 [2022-07-14 15:11:00,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 290 transitions. [2022-07-14 15:11:00,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:11:00,807 INFO L369 hiAutomatonCegarLoop]: Abstraction has 186 states and 290 transitions. [2022-07-14 15:11:00,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 290 transitions. [2022-07-14 15:11:00,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-07-14 15:11:00,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 186 states have (on average 1.5591397849462365) internal successors, (290), 185 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:11:00,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 290 transitions. [2022-07-14 15:11:00,816 INFO L392 hiAutomatonCegarLoop]: Abstraction has 186 states and 290 transitions. [2022-07-14 15:11:00,816 INFO L374 stractBuchiCegarLoop]: Abstraction has 186 states and 290 transitions. [2022-07-14 15:11:00,816 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 15:11:00,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 186 states and 290 transitions. [2022-07-14 15:11:00,817 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2022-07-14 15:11:00,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:11:00,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:11:00,818 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:11:00,818 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:11:00,818 INFO L752 eck$LassoCheckResult]: Stem: 503#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(18, 2);call #Ultimate.allocInit(12, 3); 495#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 496#L225-1 [2022-07-14 15:11:00,819 INFO L754 eck$LassoCheckResult]: Loop: 496#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 521#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 518#L93 assume !(0 != main_~p1~0#1); 519#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 513#L97-1 assume !(0 != main_~p3~0#1); 514#L101-1 assume !(0 != main_~p4~0#1); 589#L105-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 588#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 587#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 586#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 585#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 584#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 583#L129-1 assume !(0 != main_~p11~0#1); 582#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 581#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 580#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 579#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 578#L149-1 assume !(0 != main_~p1~0#1); 577#L155-1 assume 0 != main_~p2~0#1; 576#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 573#L160 assume !(0 != main_~p3~0#1); 569#L165-1 assume !(0 != main_~p4~0#1); 565#L170-1 assume !(0 != main_~p5~0#1); 562#L175-1 assume !(0 != main_~p6~0#1); 558#L180-1 assume !(0 != main_~p7~0#1); 553#L185-1 assume !(0 != main_~p8~0#1); 550#L190-1 assume !(0 != main_~p9~0#1); 546#L195-1 assume !(0 != main_~p10~0#1); 542#L200-1 assume !(0 != main_~p11~0#1); 538#L205-1 assume !(0 != main_~p12~0#1); 534#L210-1 assume !(0 != main_~p13~0#1); 530#L215-1 assume 0 != main_~p14~0#1; 528#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 526#L220 assume !(0 != main_~p15~0#1); 496#L225-1 [2022-07-14 15:11:00,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:11:00,819 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-07-14 15:11:00,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:11:00,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036501729] [2022-07-14 15:11:00,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:11:00,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:11:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:00,824 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:11:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:00,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:11:00,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:11:00,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1022104326, now seen corresponding path program 1 times [2022-07-14 15:11:00,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:11:00,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107083881] [2022-07-14 15:11:00,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:11:00,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:11:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:11:00,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:11:00,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:11:00,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107083881] [2022-07-14 15:11:00,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107083881] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:11:00,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:11:00,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:11:00,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588682784] [2022-07-14 15:11:00,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:11:00,856 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:11:00,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:11:00,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:11:00,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:11:00,857 INFO L87 Difference]: Start difference. First operand 186 states and 290 transitions. cyclomatic complexity: 108 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:11:00,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:11:00,871 INFO L93 Difference]: Finished difference Result 366 states and 566 transitions. [2022-07-14 15:11:00,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:11:00,872 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 366 states and 566 transitions. [2022-07-14 15:11:00,874 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2022-07-14 15:11:00,876 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 366 states to 366 states and 566 transitions. [2022-07-14 15:11:00,876 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 366 [2022-07-14 15:11:00,877 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 366 [2022-07-14 15:11:00,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 366 states and 566 transitions. [2022-07-14 15:11:00,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:11:00,878 INFO L369 hiAutomatonCegarLoop]: Abstraction has 366 states and 566 transitions. [2022-07-14 15:11:00,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states and 566 transitions. [2022-07-14 15:11:00,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2022-07-14 15:11:00,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 366 states have (on average 1.546448087431694) internal successors, (566), 365 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:11:00,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 566 transitions. [2022-07-14 15:11:00,890 INFO L392 hiAutomatonCegarLoop]: Abstraction has 366 states and 566 transitions. [2022-07-14 15:11:00,890 INFO L374 stractBuchiCegarLoop]: Abstraction has 366 states and 566 transitions. [2022-07-14 15:11:00,890 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 15:11:00,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 366 states and 566 transitions. [2022-07-14 15:11:00,892 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2022-07-14 15:11:00,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:11:00,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:11:00,892 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:11:00,893 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:11:00,893 INFO L752 eck$LassoCheckResult]: Stem: 1060#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(18, 2);call #Ultimate.allocInit(12, 3); 1053#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 1054#L225-1 [2022-07-14 15:11:00,893 INFO L754 eck$LassoCheckResult]: Loop: 1054#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 1078#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 1079#L93 assume !(0 != main_~p1~0#1); 1205#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 1223#L97-1 assume !(0 != main_~p3~0#1); 1220#L101-1 assume !(0 != main_~p4~0#1); 1217#L105-1 assume !(0 != main_~p5~0#1); 1215#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1214#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1212#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1210#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1208#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1206#L129-1 assume !(0 != main_~p11~0#1); 1203#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1200#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 1197#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 1193#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 1167#L149-1 assume !(0 != main_~p1~0#1); 1165#L155-1 assume 0 != main_~p2~0#1; 1162#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 1160#L160 assume !(0 != main_~p3~0#1); 1156#L165-1 assume !(0 != main_~p4~0#1); 1153#L170-1 assume !(0 != main_~p5~0#1); 1132#L175-1 assume !(0 != main_~p6~0#1); 1128#L180-1 assume !(0 != main_~p7~0#1); 1122#L185-1 assume !(0 != main_~p8~0#1); 1118#L190-1 assume !(0 != main_~p9~0#1); 1117#L195-1 assume !(0 != main_~p10~0#1); 1241#L200-1 assume !(0 != main_~p11~0#1); 1103#L205-1 assume !(0 != main_~p12~0#1); 1102#L210-1 assume !(0 != main_~p13~0#1); 1091#L215-1 assume 0 != main_~p14~0#1; 1092#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 1086#L220 assume !(0 != main_~p15~0#1); 1054#L225-1 [2022-07-14 15:11:00,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:11:00,893 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-07-14 15:11:00,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:11:00,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218714177] [2022-07-14 15:11:00,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:11:00,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:11:00,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:00,898 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:11:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:00,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:11:00,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:11:00,903 INFO L85 PathProgramCache]: Analyzing trace with hash 512631236, now seen corresponding path program 1 times [2022-07-14 15:11:00,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:11:00,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231026994] [2022-07-14 15:11:00,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:11:00,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:11:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:11:00,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:11:00,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:11:00,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231026994] [2022-07-14 15:11:00,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231026994] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:11:00,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:11:00,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:11:00,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940175957] [2022-07-14 15:11:00,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:11:00,928 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:11:00,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:11:00,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:11:00,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:11:00,929 INFO L87 Difference]: Start difference. First operand 366 states and 566 transitions. cyclomatic complexity: 208 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:11:00,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:11:00,945 INFO L93 Difference]: Finished difference Result 722 states and 1106 transitions. [2022-07-14 15:11:00,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:11:00,946 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 722 states and 1106 transitions. [2022-07-14 15:11:00,950 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2022-07-14 15:11:00,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 722 states to 722 states and 1106 transitions. [2022-07-14 15:11:00,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 722 [2022-07-14 15:11:00,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 722 [2022-07-14 15:11:00,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 722 states and 1106 transitions. [2022-07-14 15:11:00,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:11:00,959 INFO L369 hiAutomatonCegarLoop]: Abstraction has 722 states and 1106 transitions. [2022-07-14 15:11:00,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states and 1106 transitions. [2022-07-14 15:11:00,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2022-07-14 15:11:00,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 722 states have (on average 1.5318559556786704) internal successors, (1106), 721 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) [2022-07-14 15:11:00,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1106 transitions. [2022-07-14 15:11:00,994 INFO L392 hiAutomatonCegarLoop]: Abstraction has 722 states and 1106 transitions. [2022-07-14 15:11:00,994 INFO L374 stractBuchiCegarLoop]: Abstraction has 722 states and 1106 transitions. [2022-07-14 15:11:00,994 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-14 15:11:00,994 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 722 states and 1106 transitions. [2022-07-14 15:11:00,997 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2022-07-14 15:11:00,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:11:00,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:11:00,998 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:11:00,998 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:11:00,998 INFO L752 eck$LassoCheckResult]: Stem: 2165#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(18, 2);call #Ultimate.allocInit(12, 3); 2154#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 2155#L225-1 [2022-07-14 15:11:00,998 INFO L754 eck$LassoCheckResult]: Loop: 2155#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 2351#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 2348#L93 assume !(0 != main_~p1~0#1); 2349#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 2338#L97-1 assume !(0 != main_~p3~0#1); 2339#L101-1 assume !(0 != main_~p4~0#1); 2327#L105-1 assume !(0 != main_~p5~0#1); 2329#L109-1 assume !(0 != main_~p6~0#1); 2315#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2316#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2303#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 2304#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 2291#L129-1 assume !(0 != main_~p11~0#1); 2292#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 2279#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 2280#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 2267#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 2268#L149-1 assume !(0 != main_~p1~0#1); 2399#L155-1 assume 0 != main_~p2~0#1; 2398#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 2397#L160 assume !(0 != main_~p3~0#1); 2393#L165-1 assume !(0 != main_~p4~0#1); 2391#L170-1 assume !(0 != main_~p5~0#1); 2389#L175-1 assume !(0 != main_~p6~0#1); 2386#L180-1 assume !(0 != main_~p7~0#1); 2381#L185-1 assume !(0 != main_~p8~0#1); 2378#L190-1 assume !(0 != main_~p9~0#1); 2374#L195-1 assume !(0 != main_~p10~0#1); 2370#L200-1 assume !(0 != main_~p11~0#1); 2366#L205-1 assume !(0 != main_~p12~0#1); 2362#L210-1 assume !(0 != main_~p13~0#1); 2359#L215-1 assume 0 != main_~p14~0#1; 2357#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 2356#L220 assume !(0 != main_~p15~0#1); 2155#L225-1 [2022-07-14 15:11:00,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:11:00,999 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-07-14 15:11:00,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:11:00,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548195484] [2022-07-14 15:11:00,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:11:01,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:11:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:01,004 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:11:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:01,008 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:11:01,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:11:01,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1859108026, now seen corresponding path program 1 times [2022-07-14 15:11:01,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:11:01,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656610125] [2022-07-14 15:11:01,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:11:01,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:11:01,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:11:01,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:11:01,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:11:01,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656610125] [2022-07-14 15:11:01,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656610125] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:11:01,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:11:01,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:11:01,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547734980] [2022-07-14 15:11:01,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:11:01,032 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:11:01,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:11:01,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:11:01,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:11:01,033 INFO L87 Difference]: Start difference. First operand 722 states and 1106 transitions. cyclomatic complexity: 400 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:11:01,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:11:01,046 INFO L93 Difference]: Finished difference Result 1426 states and 2162 transitions. [2022-07-14 15:11:01,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:11:01,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1426 states and 2162 transitions. [2022-07-14 15:11:01,056 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2022-07-14 15:11:01,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1426 states to 1426 states and 2162 transitions. [2022-07-14 15:11:01,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1426 [2022-07-14 15:11:01,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1426 [2022-07-14 15:11:01,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1426 states and 2162 transitions. [2022-07-14 15:11:01,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:11:01,065 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1426 states and 2162 transitions. [2022-07-14 15:11:01,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states and 2162 transitions. [2022-07-14 15:11:01,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1426. [2022-07-14 15:11:01,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1426 states have (on average 1.5161290322580645) internal successors, (2162), 1425 states have internal predecessors, (2162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:11:01,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2162 transitions. [2022-07-14 15:11:01,089 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1426 states and 2162 transitions. [2022-07-14 15:11:01,089 INFO L374 stractBuchiCegarLoop]: Abstraction has 1426 states and 2162 transitions. [2022-07-14 15:11:01,089 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-14 15:11:01,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1426 states and 2162 transitions. [2022-07-14 15:11:01,095 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2022-07-14 15:11:01,095 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:11:01,095 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:11:01,096 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:11:01,096 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:11:01,096 INFO L752 eck$LassoCheckResult]: Stem: 4312#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(18, 2);call #Ultimate.allocInit(12, 3); 4301#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 4302#L225-1 [2022-07-14 15:11:01,096 INFO L754 eck$LassoCheckResult]: Loop: 4302#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 4635#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 4632#L93 assume !(0 != main_~p1~0#1); 4595#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 4352#L97-1 assume !(0 != main_~p3~0#1); 4353#L101-1 assume !(0 != main_~p4~0#1); 4588#L105-1 assume !(0 != main_~p5~0#1); 4586#L109-1 assume !(0 != main_~p6~0#1); 4580#L113-1 assume !(0 != main_~p7~0#1); 4576#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4572#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 4569#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 4566#L129-1 assume !(0 != main_~p11~0#1); 4563#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 4559#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 4556#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 4553#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 4548#L149-1 assume !(0 != main_~p1~0#1); 4546#L155-1 assume 0 != main_~p2~0#1; 4543#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 4540#L160 assume !(0 != main_~p3~0#1); 4535#L165-1 assume !(0 != main_~p4~0#1); 4536#L170-1 assume !(0 != main_~p5~0#1); 4686#L175-1 assume !(0 != main_~p6~0#1); 4682#L180-1 assume !(0 != main_~p7~0#1); 4678#L185-1 assume !(0 != main_~p8~0#1); 4674#L190-1 assume !(0 != main_~p9~0#1); 4668#L195-1 assume !(0 != main_~p10~0#1); 4663#L200-1 assume !(0 != main_~p11~0#1); 4658#L205-1 assume !(0 != main_~p12~0#1); 4653#L210-1 assume !(0 != main_~p13~0#1); 4648#L215-1 assume 0 != main_~p14~0#1; 4645#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 4642#L220 assume !(0 != main_~p15~0#1); 4302#L225-1 [2022-07-14 15:11:01,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:11:01,097 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-07-14 15:11:01,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:11:01,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914172284] [2022-07-14 15:11:01,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:11:01,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:11:01,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:01,111 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:11:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:01,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:11:01,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:11:01,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1797068412, now seen corresponding path program 1 times [2022-07-14 15:11:01,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:11:01,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234541945] [2022-07-14 15:11:01,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:11:01,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:11:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:11:01,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:11:01,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:11:01,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234541945] [2022-07-14 15:11:01,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234541945] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:11:01,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:11:01,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:11:01,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342997982] [2022-07-14 15:11:01,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:11:01,176 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:11:01,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:11:01,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:11:01,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:11:01,178 INFO L87 Difference]: Start difference. First operand 1426 states and 2162 transitions. cyclomatic complexity: 768 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:11:01,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:11:01,213 INFO L93 Difference]: Finished difference Result 2818 states and 4226 transitions. [2022-07-14 15:11:01,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:11:01,215 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2818 states and 4226 transitions. [2022-07-14 15:11:01,233 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2022-07-14 15:11:01,243 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2818 states to 2818 states and 4226 transitions. [2022-07-14 15:11:01,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2818 [2022-07-14 15:11:01,246 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2818 [2022-07-14 15:11:01,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2818 states and 4226 transitions. [2022-07-14 15:11:01,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:11:01,249 INFO L369 hiAutomatonCegarLoop]: Abstraction has 2818 states and 4226 transitions. [2022-07-14 15:11:01,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states and 4226 transitions. [2022-07-14 15:11:01,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2818. [2022-07-14 15:11:01,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2818 states, 2818 states have (on average 1.4996451383960256) internal successors, (4226), 2817 states have internal predecessors, (4226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:11:01,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 4226 transitions. [2022-07-14 15:11:01,291 INFO L392 hiAutomatonCegarLoop]: Abstraction has 2818 states and 4226 transitions. [2022-07-14 15:11:01,291 INFO L374 stractBuchiCegarLoop]: Abstraction has 2818 states and 4226 transitions. [2022-07-14 15:11:01,293 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-14 15:11:01,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2818 states and 4226 transitions. [2022-07-14 15:11:01,305 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2022-07-14 15:11:01,305 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:11:01,305 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:11:01,308 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:11:01,308 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:11:01,309 INFO L752 eck$LassoCheckResult]: Stem: 8565#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(18, 2);call #Ultimate.allocInit(12, 3); 8557#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 8558#L225-1 [2022-07-14 15:11:01,309 INFO L754 eck$LassoCheckResult]: Loop: 8558#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 8705#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 8706#L93 assume !(0 != main_~p1~0#1); 8830#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 8829#L97-1 assume !(0 != main_~p3~0#1); 8827#L101-1 assume !(0 != main_~p4~0#1); 8824#L105-1 assume !(0 != main_~p5~0#1); 8820#L109-1 assume !(0 != main_~p6~0#1); 8816#L113-1 assume !(0 != main_~p7~0#1); 8812#L117-1 assume !(0 != main_~p8~0#1); 8810#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 8808#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 8806#L129-1 assume !(0 != main_~p11~0#1); 8804#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 8802#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 8800#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 8798#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 8795#L149-1 assume !(0 != main_~p1~0#1); 8796#L155-1 assume 0 != main_~p2~0#1; 8785#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 8786#L160 assume !(0 != main_~p3~0#1); 8777#L165-1 assume !(0 != main_~p4~0#1); 8778#L170-1 assume !(0 != main_~p5~0#1); 8766#L175-1 assume !(0 != main_~p6~0#1); 8768#L180-1 assume !(0 != main_~p7~0#1); 8756#L185-1 assume !(0 != main_~p8~0#1); 8757#L190-1 assume !(0 != main_~p9~0#1); 8747#L195-1 assume !(0 != main_~p10~0#1); 8746#L200-1 assume !(0 != main_~p11~0#1); 8735#L205-1 assume !(0 != main_~p12~0#1); 8734#L210-1 assume !(0 != main_~p13~0#1); 8722#L215-1 assume 0 != main_~p14~0#1; 8723#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 8715#L220 assume !(0 != main_~p15~0#1); 8558#L225-1 [2022-07-14 15:11:01,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:11:01,314 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2022-07-14 15:11:01,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:11:01,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931339191] [2022-07-14 15:11:01,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:11:01,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:11:01,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:01,321 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:11:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:01,336 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:11:01,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:11:01,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1656519802, now seen corresponding path program 1 times [2022-07-14 15:11:01,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:11:01,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066469645] [2022-07-14 15:11:01,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:11:01,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:11:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:11:01,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:11:01,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:11:01,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066469645] [2022-07-14 15:11:01,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066469645] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:11:01,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:11:01,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:11:01,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508361457] [2022-07-14 15:11:01,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:11:01,378 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:11:01,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:11:01,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:11:01,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:11:01,379 INFO L87 Difference]: Start difference. First operand 2818 states and 4226 transitions. cyclomatic complexity: 1472 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:11:01,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:11:01,408 INFO L93 Difference]: Finished difference Result 5570 states and 8258 transitions. [2022-07-14 15:11:01,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:11:01,409 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5570 states and 8258 transitions. [2022-07-14 15:11:01,439 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2022-07-14 15:11:01,459 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5570 states to 5570 states and 8258 transitions. [2022-07-14 15:11:01,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5570 [2022-07-14 15:11:01,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5570 [2022-07-14 15:11:01,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5570 states and 8258 transitions. [2022-07-14 15:11:01,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:11:01,470 INFO L369 hiAutomatonCegarLoop]: Abstraction has 5570 states and 8258 transitions. [2022-07-14 15:11:01,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5570 states and 8258 transitions. [2022-07-14 15:11:01,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5570 to 5570. [2022-07-14 15:11:01,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5570 states, 5570 states have (on average 1.4825852782764812) internal successors, (8258), 5569 states have internal predecessors, (8258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:11:01,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5570 states to 5570 states and 8258 transitions. [2022-07-14 15:11:01,568 INFO L392 hiAutomatonCegarLoop]: Abstraction has 5570 states and 8258 transitions. [2022-07-14 15:11:01,568 INFO L374 stractBuchiCegarLoop]: Abstraction has 5570 states and 8258 transitions. [2022-07-14 15:11:01,568 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-14 15:11:01,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5570 states and 8258 transitions. [2022-07-14 15:11:01,589 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2022-07-14 15:11:01,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:11:01,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:11:01,590 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:11:01,590 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:11:01,590 INFO L752 eck$LassoCheckResult]: Stem: 16967#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(18, 2);call #Ultimate.allocInit(12, 3); 16953#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 16954#L225-1 [2022-07-14 15:11:01,591 INFO L754 eck$LassoCheckResult]: Loop: 16954#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 17157#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 17155#L93 assume !(0 != main_~p1~0#1); 17151#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 17147#L97-1 assume !(0 != main_~p3~0#1); 17140#L101-1 assume !(0 != main_~p4~0#1); 17132#L105-1 assume !(0 != main_~p5~0#1); 17127#L109-1 assume !(0 != main_~p6~0#1); 17120#L113-1 assume !(0 != main_~p7~0#1); 17112#L117-1 assume !(0 != main_~p8~0#1); 17104#L121-1 assume !(0 != main_~p9~0#1); 17099#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 17095#L129-1 assume !(0 != main_~p11~0#1); 17091#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 17087#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 17083#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 17079#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 17073#L149-1 assume !(0 != main_~p1~0#1); 17074#L155-1 assume 0 != main_~p2~0#1; 17211#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 17206#L160 assume !(0 != main_~p3~0#1); 17201#L165-1 assume !(0 != main_~p4~0#1); 17197#L170-1 assume !(0 != main_~p5~0#1); 17193#L175-1 assume !(0 != main_~p6~0#1); 17191#L180-1 assume !(0 != main_~p7~0#1); 17189#L185-1 assume !(0 != main_~p8~0#1); 17185#L190-1 assume !(0 != main_~p9~0#1); 17182#L195-1 assume !(0 != main_~p10~0#1); 17178#L200-1 assume !(0 != main_~p11~0#1); 17174#L205-1 assume !(0 != main_~p12~0#1); 17170#L210-1 assume !(0 != main_~p13~0#1); 17166#L215-1 assume 0 != main_~p14~0#1; 17164#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 17162#L220 assume !(0 != main_~p15~0#1); 16954#L225-1 [2022-07-14 15:11:01,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:11:01,592 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2022-07-14 15:11:01,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:11:01,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619582851] [2022-07-14 15:11:01,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:11:01,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:11:01,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:01,601 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:11:01,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:01,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:11:01,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:11:01,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1790533308, now seen corresponding path program 1 times [2022-07-14 15:11:01,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:11:01,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55034485] [2022-07-14 15:11:01,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:11:01,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:11:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:11:01,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:11:01,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:11:01,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55034485] [2022-07-14 15:11:01,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55034485] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:11:01,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:11:01,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:11:01,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671532765] [2022-07-14 15:11:01,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:11:01,657 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:11:01,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:11:01,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:11:01,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:11:01,658 INFO L87 Difference]: Start difference. First operand 5570 states and 8258 transitions. cyclomatic complexity: 2816 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:11:01,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:11:01,736 INFO L93 Difference]: Finished difference Result 11010 states and 16130 transitions. [2022-07-14 15:11:01,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:11:01,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11010 states and 16130 transitions. [2022-07-14 15:11:01,796 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2022-07-14 15:11:01,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11010 states to 11010 states and 16130 transitions. [2022-07-14 15:11:01,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11010 [2022-07-14 15:11:01,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11010 [2022-07-14 15:11:01,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11010 states and 16130 transitions. [2022-07-14 15:11:01,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:11:01,860 INFO L369 hiAutomatonCegarLoop]: Abstraction has 11010 states and 16130 transitions. [2022-07-14 15:11:01,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11010 states and 16130 transitions. [2022-07-14 15:11:02,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11010 to 11010. [2022-07-14 15:11:02,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11010 states, 11010 states have (on average 1.4650317892824705) internal successors, (16130), 11009 states have internal predecessors, (16130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:11:02,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11010 states to 11010 states and 16130 transitions. [2022-07-14 15:11:02,039 INFO L392 hiAutomatonCegarLoop]: Abstraction has 11010 states and 16130 transitions. [2022-07-14 15:11:02,039 INFO L374 stractBuchiCegarLoop]: Abstraction has 11010 states and 16130 transitions. [2022-07-14 15:11:02,040 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-14 15:11:02,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11010 states and 16130 transitions. [2022-07-14 15:11:02,066 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2022-07-14 15:11:02,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:11:02,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:11:02,067 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:11:02,067 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:11:02,068 INFO L752 eck$LassoCheckResult]: Stem: 33550#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(18, 2);call #Ultimate.allocInit(12, 3); 33536#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 33537#L225-1 [2022-07-14 15:11:02,068 INFO L754 eck$LassoCheckResult]: Loop: 33537#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 33841#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 33839#L93 assume !(0 != main_~p1~0#1); 33838#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 33837#L97-1 assume !(0 != main_~p3~0#1); 33835#L101-1 assume !(0 != main_~p4~0#1); 33833#L105-1 assume !(0 != main_~p5~0#1); 33831#L109-1 assume !(0 != main_~p6~0#1); 33830#L113-1 assume !(0 != main_~p7~0#1); 33828#L117-1 assume !(0 != main_~p8~0#1); 33824#L121-1 assume !(0 != main_~p9~0#1); 33821#L125-1 assume !(0 != main_~p10~0#1); 33815#L129-1 assume !(0 != main_~p11~0#1); 33816#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 33807#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 33808#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 33799#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 33800#L149-1 assume !(0 != main_~p1~0#1); 33789#L155-1 assume 0 != main_~p2~0#1; 33790#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 33781#L160 assume !(0 != main_~p3~0#1); 33780#L165-1 assume !(0 != main_~p4~0#1); 33720#L170-1 assume !(0 != main_~p5~0#1); 33721#L175-1 assume !(0 != main_~p6~0#1); 33711#L180-1 assume !(0 != main_~p7~0#1); 33712#L185-1 assume !(0 != main_~p8~0#1); 33699#L190-1 assume !(0 != main_~p9~0#1); 33701#L195-1 assume !(0 != main_~p10~0#1); 33851#L200-1 assume !(0 != main_~p11~0#1); 33849#L205-1 assume !(0 != main_~p12~0#1); 33847#L210-1 assume !(0 != main_~p13~0#1); 33845#L215-1 assume 0 != main_~p14~0#1; 33844#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 33843#L220 assume !(0 != main_~p15~0#1); 33537#L225-1 [2022-07-14 15:11:02,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:11:02,068 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2022-07-14 15:11:02,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:11:02,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690616086] [2022-07-14 15:11:02,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:11:02,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:11:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:02,072 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:11:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:02,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:11:02,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:11:02,075 INFO L85 PathProgramCache]: Analyzing trace with hash 698995654, now seen corresponding path program 1 times [2022-07-14 15:11:02,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:11:02,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124560153] [2022-07-14 15:11:02,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:11:02,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:11:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:11:02,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:11:02,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:11:02,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124560153] [2022-07-14 15:11:02,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124560153] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:11:02,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:11:02,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:11:02,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814464381] [2022-07-14 15:11:02,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:11:02,136 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:11:02,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:11:02,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:11:02,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:11:02,137 INFO L87 Difference]: Start difference. First operand 11010 states and 16130 transitions. cyclomatic complexity: 5376 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:11:02,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:11:02,260 INFO L93 Difference]: Finished difference Result 21762 states and 31490 transitions. [2022-07-14 15:11:02,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:11:02,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21762 states and 31490 transitions. [2022-07-14 15:11:02,365 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2022-07-14 15:11:02,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21762 states to 21762 states and 31490 transitions. [2022-07-14 15:11:02,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21762 [2022-07-14 15:11:02,435 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21762 [2022-07-14 15:11:02,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21762 states and 31490 transitions. [2022-07-14 15:11:02,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:11:02,450 INFO L369 hiAutomatonCegarLoop]: Abstraction has 21762 states and 31490 transitions. [2022-07-14 15:11:02,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21762 states and 31490 transitions. [2022-07-14 15:11:02,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21762 to 21762. [2022-07-14 15:11:02,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21762 states, 21762 states have (on average 1.447017737340318) internal successors, (31490), 21761 states have internal predecessors, (31490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:11:02,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21762 states to 21762 states and 31490 transitions. [2022-07-14 15:11:02,793 INFO L392 hiAutomatonCegarLoop]: Abstraction has 21762 states and 31490 transitions. [2022-07-14 15:11:02,793 INFO L374 stractBuchiCegarLoop]: Abstraction has 21762 states and 31490 transitions. [2022-07-14 15:11:02,793 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-14 15:11:02,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21762 states and 31490 transitions. [2022-07-14 15:11:02,834 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2022-07-14 15:11:02,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:11:02,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:11:02,835 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:11:02,836 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:11:02,836 INFO L752 eck$LassoCheckResult]: Stem: 66321#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(18, 2);call #Ultimate.allocInit(12, 3); 66308#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 66309#L225-1 [2022-07-14 15:11:02,836 INFO L754 eck$LassoCheckResult]: Loop: 66309#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 66490#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 66486#L93 assume !(0 != main_~p1~0#1); 66484#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 66482#L97-1 assume !(0 != main_~p3~0#1); 66478#L101-1 assume !(0 != main_~p4~0#1); 66474#L105-1 assume !(0 != main_~p5~0#1); 66472#L109-1 assume !(0 != main_~p6~0#1); 66468#L113-1 assume !(0 != main_~p7~0#1); 66464#L117-1 assume !(0 != main_~p8~0#1); 66460#L121-1 assume !(0 != main_~p9~0#1); 66456#L125-1 assume !(0 != main_~p10~0#1); 66454#L129-1 assume !(0 != main_~p11~0#1); 66450#L133-1 assume !(0 != main_~p12~0#1); 66448#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 66446#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 66444#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 66440#L149-1 assume !(0 != main_~p1~0#1); 66438#L155-1 assume 0 != main_~p2~0#1; 66436#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 66433#L160 assume !(0 != main_~p3~0#1); 66428#L165-1 assume !(0 != main_~p4~0#1); 66424#L170-1 assume !(0 != main_~p5~0#1); 66421#L175-1 assume !(0 != main_~p6~0#1); 66422#L180-1 assume !(0 != main_~p7~0#1); 66521#L185-1 assume !(0 != main_~p8~0#1); 66517#L190-1 assume !(0 != main_~p9~0#1); 66513#L195-1 assume !(0 != main_~p10~0#1); 66510#L200-1 assume !(0 != main_~p11~0#1); 66505#L205-1 assume !(0 != main_~p12~0#1); 66502#L210-1 assume !(0 != main_~p13~0#1); 66499#L215-1 assume 0 != main_~p14~0#1; 66497#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 66494#L220 assume !(0 != main_~p15~0#1); 66309#L225-1 [2022-07-14 15:11:02,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:11:02,836 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2022-07-14 15:11:02,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:11:02,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752484981] [2022-07-14 15:11:02,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:11:02,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:11:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:02,842 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:11:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:02,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:11:02,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:11:02,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1121697480, now seen corresponding path program 1 times [2022-07-14 15:11:02,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:11:02,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404377104] [2022-07-14 15:11:02,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:11:02,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:11:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:11:02,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:11:02,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:11:02,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404377104] [2022-07-14 15:11:02,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404377104] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:11:02,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:11:02,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:11:02,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755983330] [2022-07-14 15:11:02,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:11:02,865 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:11:02,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:11:02,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:11:02,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:11:02,870 INFO L87 Difference]: Start difference. First operand 21762 states and 31490 transitions. cyclomatic complexity: 10240 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:11:03,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:11:03,015 INFO L93 Difference]: Finished difference Result 43010 states and 61442 transitions. [2022-07-14 15:11:03,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:11:03,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43010 states and 61442 transitions. [2022-07-14 15:11:03,167 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2022-07-14 15:11:03,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43010 states to 43010 states and 61442 transitions. [2022-07-14 15:11:03,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43010 [2022-07-14 15:11:03,294 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43010 [2022-07-14 15:11:03,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43010 states and 61442 transitions. [2022-07-14 15:11:03,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:11:03,325 INFO L369 hiAutomatonCegarLoop]: Abstraction has 43010 states and 61442 transitions. [2022-07-14 15:11:03,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43010 states and 61442 transitions. [2022-07-14 15:11:03,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43010 to 43010. [2022-07-14 15:11:03,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43010 states, 43010 states have (on average 1.4285514996512438) internal successors, (61442), 43009 states have internal predecessors, (61442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:11:04,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43010 states to 43010 states and 61442 transitions. [2022-07-14 15:11:04,024 INFO L392 hiAutomatonCegarLoop]: Abstraction has 43010 states and 61442 transitions. [2022-07-14 15:11:04,024 INFO L374 stractBuchiCegarLoop]: Abstraction has 43010 states and 61442 transitions. [2022-07-14 15:11:04,024 INFO L287 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-14 15:11:04,024 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43010 states and 61442 transitions. [2022-07-14 15:11:04,108 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2022-07-14 15:11:04,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:11:04,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:11:04,109 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:11:04,109 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:11:04,109 INFO L752 eck$LassoCheckResult]: Stem: 131107#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(18, 2);call #Ultimate.allocInit(12, 3); 131095#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 131096#L225-1 [2022-07-14 15:11:04,109 INFO L754 eck$LassoCheckResult]: Loop: 131096#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 132419#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 132416#L93 assume !(0 != main_~p1~0#1); 132413#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 132411#L97-1 assume !(0 != main_~p3~0#1); 132408#L101-1 assume !(0 != main_~p4~0#1); 132404#L105-1 assume !(0 != main_~p5~0#1); 132400#L109-1 assume !(0 != main_~p6~0#1); 132396#L113-1 assume !(0 != main_~p7~0#1); 132392#L117-1 assume !(0 != main_~p8~0#1); 132388#L121-1 assume !(0 != main_~p9~0#1); 132384#L125-1 assume !(0 != main_~p10~0#1); 132381#L129-1 assume !(0 != main_~p11~0#1); 132378#L133-1 assume !(0 != main_~p12~0#1); 132379#L137-1 assume !(0 != main_~p13~0#1); 132483#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 132481#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 132476#L149-1 assume !(0 != main_~p1~0#1); 132474#L155-1 assume 0 != main_~p2~0#1; 132472#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 132304#L160 assume !(0 != main_~p3~0#1); 132303#L165-1 assume !(0 != main_~p4~0#1); 132269#L170-1 assume !(0 != main_~p5~0#1); 132270#L175-1 assume !(0 != main_~p6~0#1); 132246#L180-1 assume !(0 != main_~p7~0#1); 132247#L185-1 assume !(0 != main_~p8~0#1); 132158#L190-1 assume !(0 != main_~p9~0#1); 132160#L195-1 assume !(0 != main_~p10~0#1); 132436#L200-1 assume !(0 != main_~p11~0#1); 132431#L205-1 assume !(0 != main_~p12~0#1); 132429#L210-1 assume !(0 != main_~p13~0#1); 132428#L215-1 assume 0 != main_~p14~0#1; 132426#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 132424#L220 assume !(0 != main_~p15~0#1); 131096#L225-1 [2022-07-14 15:11:04,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:11:04,109 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2022-07-14 15:11:04,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:11:04,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450832064] [2022-07-14 15:11:04,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:11:04,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:11:04,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:04,113 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:11:04,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:04,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:11:04,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:11:04,115 INFO L85 PathProgramCache]: Analyzing trace with hash 304049030, now seen corresponding path program 1 times [2022-07-14 15:11:04,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:11:04,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271167677] [2022-07-14 15:11:04,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:11:04,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:11:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:11:04,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:11:04,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:11:04,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271167677] [2022-07-14 15:11:04,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271167677] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:11:04,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:11:04,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 15:11:04,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283131887] [2022-07-14 15:11:04,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:11:04,128 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:11:04,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:11:04,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:11:04,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:11:04,129 INFO L87 Difference]: Start difference. First operand 43010 states and 61442 transitions. cyclomatic complexity: 19456 Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:11:04,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:11:04,294 INFO L93 Difference]: Finished difference Result 84994 states and 119810 transitions. [2022-07-14 15:11:04,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:11:04,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84994 states and 119810 transitions. [2022-07-14 15:11:04,709 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2022-07-14 15:11:05,064 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84994 states to 84994 states and 119810 transitions. [2022-07-14 15:11:05,065 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84994 [2022-07-14 15:11:05,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84994 [2022-07-14 15:11:05,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84994 states and 119810 transitions. [2022-07-14 15:11:05,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:11:05,158 INFO L369 hiAutomatonCegarLoop]: Abstraction has 84994 states and 119810 transitions. [2022-07-14 15:11:05,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84994 states and 119810 transitions. [2022-07-14 15:11:06,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84994 to 84994. [2022-07-14 15:11:06,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84994 states, 84994 states have (on average 1.409628914982234) internal successors, (119810), 84993 states have internal predecessors, (119810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:11:06,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84994 states to 84994 states and 119810 transitions. [2022-07-14 15:11:06,277 INFO L392 hiAutomatonCegarLoop]: Abstraction has 84994 states and 119810 transitions. [2022-07-14 15:11:06,277 INFO L374 stractBuchiCegarLoop]: Abstraction has 84994 states and 119810 transitions. [2022-07-14 15:11:06,277 INFO L287 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-14 15:11:06,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84994 states and 119810 transitions. [2022-07-14 15:11:06,605 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2022-07-14 15:11:06,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:11:06,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:11:06,606 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:11:06,606 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:11:06,606 INFO L752 eck$LassoCheckResult]: Stem: 259110#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(18, 2);call #Ultimate.allocInit(12, 3); 259098#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 259099#L225-1 [2022-07-14 15:11:06,606 INFO L754 eck$LassoCheckResult]: Loop: 259099#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 260713#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 260700#L93 assume !(0 != main_~p1~0#1); 260702#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 260686#L97-1 assume !(0 != main_~p3~0#1); 260687#L101-1 assume !(0 != main_~p4~0#1); 260670#L105-1 assume !(0 != main_~p5~0#1); 260672#L109-1 assume !(0 != main_~p6~0#1); 260644#L113-1 assume !(0 != main_~p7~0#1); 260646#L117-1 assume !(0 != main_~p8~0#1); 260618#L121-1 assume !(0 != main_~p9~0#1); 260620#L125-1 assume !(0 != main_~p10~0#1); 260839#L129-1 assume !(0 != main_~p11~0#1); 260837#L133-1 assume !(0 != main_~p12~0#1); 260833#L137-1 assume !(0 != main_~p13~0#1); 260830#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 260827#L145-1 assume !(0 != main_~p15~0#1); 260824#L149-1 assume !(0 != main_~p1~0#1); 260821#L155-1 assume 0 != main_~p2~0#1; 260818#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 260796#L160 assume !(0 != main_~p3~0#1); 260787#L165-1 assume !(0 != main_~p4~0#1); 260779#L170-1 assume !(0 != main_~p5~0#1); 260771#L175-1 assume !(0 != main_~p6~0#1); 260765#L180-1 assume !(0 != main_~p7~0#1); 260761#L185-1 assume !(0 != main_~p8~0#1); 260758#L190-1 assume !(0 != main_~p9~0#1); 260756#L195-1 assume !(0 != main_~p10~0#1); 260753#L200-1 assume !(0 != main_~p11~0#1); 260730#L205-1 assume !(0 != main_~p12~0#1); 260732#L210-1 assume !(0 != main_~p13~0#1); 260746#L215-1 assume 0 != main_~p14~0#1; 260738#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 260739#L220 assume !(0 != main_~p15~0#1); 259099#L225-1 [2022-07-14 15:11:06,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:11:06,607 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2022-07-14 15:11:06,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:11:06,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298057436] [2022-07-14 15:11:06,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:11:06,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:11:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:06,610 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:11:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:06,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:11:06,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:11:06,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1690095676, now seen corresponding path program 1 times [2022-07-14 15:11:06,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:11:06,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399105689] [2022-07-14 15:11:06,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:11:06,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:11:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:06,617 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:11:06,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:06,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:11:06,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:11:06,623 INFO L85 PathProgramCache]: Analyzing trace with hash 365150982, now seen corresponding path program 1 times [2022-07-14 15:11:06,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:11:06,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36234931] [2022-07-14 15:11:06,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:11:06,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:11:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:06,628 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:11:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:11:06,633 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:11:06,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.07 03:11:06 BoogieIcfgContainer [2022-07-14 15:11:06,970 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-14 15:11:06,970 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 15:11:06,970 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 15:11:06,971 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 15:11:06,971 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:11:00" (3/4) ... [2022-07-14 15:11:06,973 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-07-14 15:11:07,006 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-14 15:11:07,006 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 15:11:07,007 INFO L158 Benchmark]: Toolchain (without parser) took 7270.66ms. Allocated memory was 79.7MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 43.5MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 702.6MB. Max. memory is 16.1GB. [2022-07-14 15:11:07,007 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 79.7MB. Free memory was 59.6MB in the beginning and 59.6MB in the end (delta: 40.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 15:11:07,007 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.42ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 43.3MB in the beginning and 72.1MB in the end (delta: -28.8MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. [2022-07-14 15:11:07,007 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.60ms. Allocated memory is still 96.5MB. Free memory was 72.1MB in the beginning and 70.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 15:11:07,008 INFO L158 Benchmark]: Boogie Preprocessor took 47.82ms. Allocated memory is still 96.5MB. Free memory was 70.2MB in the beginning and 68.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 15:11:07,008 INFO L158 Benchmark]: RCFGBuilder took 280.77ms. Allocated memory is still 96.5MB. Free memory was 68.6MB in the beginning and 55.9MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-14 15:11:07,008 INFO L158 Benchmark]: BuchiAutomizer took 6654.92ms. Allocated memory was 96.5MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 55.7MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 699.0MB. Max. memory is 16.1GB. [2022-07-14 15:11:07,008 INFO L158 Benchmark]: Witness Printer took 36.04ms. Allocated memory is still 2.5GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 15:11:07,009 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.16ms. Allocated memory is still 79.7MB. Free memory was 59.6MB in the beginning and 59.6MB in the end (delta: 40.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.42ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 43.3MB in the beginning and 72.1MB in the end (delta: -28.8MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.60ms. Allocated memory is still 96.5MB. Free memory was 72.1MB in the beginning and 70.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.82ms. Allocated memory is still 96.5MB. Free memory was 70.2MB in the beginning and 68.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 280.77ms. Allocated memory is still 96.5MB. Free memory was 68.6MB in the beginning and 55.9MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 6654.92ms. Allocated memory was 96.5MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 55.7MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 699.0MB. Max. memory is 16.1GB. * Witness Printer took 36.04ms. Allocated memory is still 2.5GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (11 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.11 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 84994 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.5s and 12 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 0. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 2.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 1.4s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 648 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 648 mSDsluCounter, 2072 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 801 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55 IncrementalHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 1271 mSDtfsCounter, 55 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI11 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 56]: 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 {p11=0, p13=0, lk5=0, p1=0, NULL=0, p9=0, NULL=1, cond=5, p12=0, p10=0, p14=6, p8=0, lk6=0, lk15=0, p3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1cdc0aad=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@36556fc2=0, p15=0, \result=0, lk7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@293c12c7=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7acf06ca=0, lk14=0, p2=4, lk8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@332a23aa=5, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6cf66b79=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6e73b69=0, lk13=0, lk9=0, lk12=0, p5=0, lk2=0, p4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@77428c12=0, lk11=0, lk1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2a574f95=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@b3776bb=0, p7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7f1848e3=0, lk10=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4a7d3586=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@67f94e88=0, p6=0, lk4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@c296d35=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2515ef36=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@49c8466=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 56]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L50] int p15 = __VERIFIER_nondet_int(); [L51] int lk15; [L54] int cond; Loop: [L56] COND TRUE 1 [L57] cond = __VERIFIER_nondet_int() [L58] COND FALSE !(cond == 0) [L61] lk1 = 0 [L63] lk2 = 0 [L65] lk3 = 0 [L67] lk4 = 0 [L69] lk5 = 0 [L71] lk6 = 0 [L73] lk7 = 0 [L75] lk8 = 0 [L77] lk9 = 0 [L79] lk10 = 0 [L81] lk11 = 0 [L83] lk12 = 0 [L85] lk13 = 0 [L87] lk14 = 0 [L89] lk15 = 0 [L93] COND FALSE !(p1 != 0) [L97] COND TRUE p2 != 0 [L98] lk2 = 1 [L101] COND FALSE !(p3 != 0) [L105] COND FALSE !(p4 != 0) [L109] COND FALSE !(p5 != 0) [L113] COND FALSE !(p6 != 0) [L117] COND FALSE !(p7 != 0) [L121] COND FALSE !(p8 != 0) [L125] COND FALSE !(p9 != 0) [L129] COND FALSE !(p10 != 0) [L133] COND FALSE !(p11 != 0) [L137] COND FALSE !(p12 != 0) [L141] COND FALSE !(p13 != 0) [L145] COND TRUE p14 != 0 [L146] lk14 = 1 [L149] COND FALSE !(p15 != 0) [L155] COND FALSE !(p1 != 0) [L160] COND TRUE p2 != 0 [L161] COND FALSE !(lk2 != 1) [L162] lk2 = 0 [L165] COND FALSE !(p3 != 0) [L170] COND FALSE !(p4 != 0) [L175] COND FALSE !(p5 != 0) [L180] COND FALSE !(p6 != 0) [L185] COND FALSE !(p7 != 0) [L190] COND FALSE !(p8 != 0) [L195] COND FALSE !(p9 != 0) [L200] COND FALSE !(p10 != 0) [L205] COND FALSE !(p11 != 0) [L210] COND FALSE !(p12 != 0) [L215] COND FALSE !(p13 != 0) [L220] COND TRUE p14 != 0 [L221] COND FALSE !(lk14 != 1) [L222] lk14 = 0 [L225] COND FALSE !(p15 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-07-14 15:11:07,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)