./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d63a95a-6c11-40f6-a2b4-86a13f230a85/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d63a95a-6c11-40f6-a2b4-86a13f230a85/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d63a95a-6c11-40f6-a2b4-86a13f230a85/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d63a95a-6c11-40f6-a2b4-86a13f230a85/bin/uautomizer-uyxdKDjOR8/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_13.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d63a95a-6c11-40f6-a2b4-86a13f230a85/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d63a95a-6c11-40f6-a2b4-86a13f230a85/bin/uautomizer-uyxdKDjOR8 --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 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 21:35:11,030 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 21:35:11,032 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 21:35:11,044 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 21:35:11,044 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 21:35:11,045 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 21:35:11,046 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 21:35:11,047 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 21:35:11,048 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 21:35:11,048 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 21:35:11,049 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 21:35:11,050 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 21:35:11,050 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 21:35:11,050 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 21:35:11,051 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 21:35:11,052 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 21:35:11,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 21:35:11,053 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 21:35:11,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 21:35:11,055 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 21:35:11,056 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 21:35:11,057 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 21:35:11,057 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 21:35:11,058 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 21:35:11,060 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 21:35:11,060 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 21:35:11,060 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 21:35:11,061 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 21:35:11,061 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 21:35:11,062 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 21:35:11,062 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 21:35:11,062 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 21:35:11,063 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 21:35:11,063 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 21:35:11,064 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 21:35:11,064 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 21:35:11,064 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 21:35:11,065 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 21:35:11,065 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 21:35:11,065 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 21:35:11,066 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 21:35:11,066 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d63a95a-6c11-40f6-a2b4-86a13f230a85/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-12-13 21:35:11,081 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 21:35:11,081 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 21:35:11,081 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 21:35:11,081 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 21:35:11,082 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 21:35:11,082 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 21:35:11,082 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 21:35:11,082 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-12-13 21:35:11,082 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-12-13 21:35:11,089 INFO L138 SettingsManager]: * Use old map elimination=false [2022-12-13 21:35:11,089 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-12-13 21:35:11,089 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-12-13 21:35:11,090 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-12-13 21:35:11,090 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 21:35:11,090 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 21:35:11,090 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 21:35:11,090 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 21:35:11,090 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 21:35:11,090 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 21:35:11,090 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-12-13 21:35:11,091 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-12-13 21:35:11,091 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-12-13 21:35:11,091 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 21:35:11,091 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 21:35:11,091 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-12-13 21:35:11,091 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 21:35:11,091 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-12-13 21:35:11,091 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 21:35:11,092 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 21:35:11,092 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 21:35:11,092 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 21:35:11,093 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-12-13 21:35:11,093 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d63a95a-6c11-40f6-a2b4-86a13f230a85/bin/uautomizer-uyxdKDjOR8/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d63a95a-6c11-40f6-a2b4-86a13f230a85/bin/uautomizer-uyxdKDjOR8 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 -> 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd [2022-12-13 21:35:11,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 21:35:11,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 21:35:11,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 21:35:11,279 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 21:35:11,279 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 21:35:11,281 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d63a95a-6c11-40f6-a2b4-86a13f230a85/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/locks/test_locks_13.c [2022-12-13 21:35:13,884 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 21:35:14,010 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 21:35:14,010 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d63a95a-6c11-40f6-a2b4-86a13f230a85/sv-benchmarks/c/locks/test_locks_13.c [2022-12-13 21:35:14,015 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d63a95a-6c11-40f6-a2b4-86a13f230a85/bin/uautomizer-uyxdKDjOR8/data/7349979b2/2ebceb5e860b42f089949b06ac0b5445/FLAG78536d505 [2022-12-13 21:35:14,025 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d63a95a-6c11-40f6-a2b4-86a13f230a85/bin/uautomizer-uyxdKDjOR8/data/7349979b2/2ebceb5e860b42f089949b06ac0b5445 [2022-12-13 21:35:14,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 21:35:14,028 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 21:35:14,029 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 21:35:14,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 21:35:14,032 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 21:35:14,033 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:35:14" (1/1) ... [2022-12-13 21:35:14,034 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b966ef4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:35:14, skipping insertion in model container [2022-12-13 21:35:14,034 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:35:14" (1/1) ... [2022-12-13 21:35:14,039 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 21:35:14,061 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 21:35:14,187 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d63a95a-6c11-40f6-a2b4-86a13f230a85/sv-benchmarks/c/locks/test_locks_13.c[4936,4949] [2022-12-13 21:35:14,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:35:14,198 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 21:35:14,216 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d63a95a-6c11-40f6-a2b4-86a13f230a85/sv-benchmarks/c/locks/test_locks_13.c[4936,4949] [2022-12-13 21:35:14,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:35:14,227 INFO L208 MainTranslator]: Completed translation [2022-12-13 21:35:14,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:35:14 WrapperNode [2022-12-13 21:35:14,227 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 21:35:14,228 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 21:35:14,228 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 21:35:14,228 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 21:35:14,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:35:14" (1/1) ... [2022-12-13 21:35:14,239 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:35:14" (1/1) ... [2022-12-13 21:35:14,253 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 157 [2022-12-13 21:35:14,254 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 21:35:14,254 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 21:35:14,254 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 21:35:14,254 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 21:35:14,261 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:35:14" (1/1) ... [2022-12-13 21:35:14,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:35:14" (1/1) ... [2022-12-13 21:35:14,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:35:14" (1/1) ... [2022-12-13 21:35:14,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:35:14" (1/1) ... [2022-12-13 21:35:14,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:35:14" (1/1) ... [2022-12-13 21:35:14,268 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:35:14" (1/1) ... [2022-12-13 21:35:14,269 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:35:14" (1/1) ... [2022-12-13 21:35:14,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:35:14" (1/1) ... [2022-12-13 21:35:14,272 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 21:35:14,272 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 21:35:14,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 21:35:14,272 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 21:35:14,273 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:35:14" (1/1) ... [2022-12-13 21:35:14,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 21:35:14,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d63a95a-6c11-40f6-a2b4-86a13f230a85/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:35:14,300 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d63a95a-6c11-40f6-a2b4-86a13f230a85/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 21:35:14,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d63a95a-6c11-40f6-a2b4-86a13f230a85/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-12-13 21:35:14,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 21:35:14,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 21:35:14,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 21:35:14,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 21:35:14,393 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 21:35:14,394 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 21:35:14,547 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 21:35:14,553 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 21:35:14,553 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 21:35:14,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:35:14 BoogieIcfgContainer [2022-12-13 21:35:14,554 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 21:35:14,555 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-12-13 21:35:14,555 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-12-13 21:35:14,558 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-12-13 21:35:14,558 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 21:35:14,559 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.12 09:35:14" (1/3) ... [2022-12-13 21:35:14,559 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2706f8e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 09:35:14, skipping insertion in model container [2022-12-13 21:35:14,559 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 21:35:14,559 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:35:14" (2/3) ... [2022-12-13 21:35:14,560 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2706f8e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 09:35:14, skipping insertion in model container [2022-12-13 21:35:14,560 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 21:35:14,560 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:35:14" (3/3) ... [2022-12-13 21:35:14,561 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_13.c [2022-12-13 21:35:14,602 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-12-13 21:35:14,602 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-12-13 21:35:14,602 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-12-13 21:35:14,602 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-12-13 21:35:14,602 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-12-13 21:35:14,603 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-12-13 21:35:14,603 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-12-13 21:35:14,603 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-12-13 21:35:14,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 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-12-13 21:35:14,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2022-12-13 21:35:14,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 21:35:14,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 21:35:14,624 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 21:35:14,624 INFO L149 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] [2022-12-13 21:35:14,625 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-12-13 21:35:14,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 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-12-13 21:35:14,627 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2022-12-13 21:35:14,627 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 21:35:14,627 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 21:35:14,627 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 21:35:14,628 INFO L149 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] [2022-12-13 21:35:14,633 INFO L748 eck$LassoCheckResult]: Stem: 42#$Ultimate##0true 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(16, 2);call #Ultimate.allocInit(12, 3); 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#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_~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;havoc main_~cond~0#1; 13#L197-1true [2022-12-13 21:35:14,634 INFO L750 eck$LassoCheckResult]: Loop: 13#L197-1true assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 44#L52true 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; 28#L83true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 15#L83-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 9#L87-1true assume !(0 != main_~p3~0#1); 3#L91-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 46#L95-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 16#L99-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 10#L103-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 25#L107-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 14#L111-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 31#L115-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 34#L119-1true assume !(0 != main_~p11~0#1); 47#L123-1true assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 26#L127-1true assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 35#L131-1true assume !(0 != main_~p1~0#1); 12#L137-1true assume !(0 != main_~p2~0#1); 7#L142-1true assume !(0 != main_~p3~0#1); 36#L147-1true assume !(0 != main_~p4~0#1); 11#L152-1true assume !(0 != main_~p5~0#1); 21#L157-1true assume !(0 != main_~p6~0#1); 18#L162-1true assume !(0 != main_~p7~0#1); 19#L167-1true assume !(0 != main_~p8~0#1); 23#L172-1true assume !(0 != main_~p9~0#1); 30#L177-1true assume !(0 != main_~p10~0#1); 48#L182-1true assume !(0 != main_~p11~0#1); 45#L187-1true assume !(0 != main_~p12~0#1); 38#L192-1true assume !(0 != main_~p13~0#1); 13#L197-1true [2022-12-13 21:35:14,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:35:14,639 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-12-13 21:35:14,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:35:14,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926804259] [2022-12-13 21:35:14,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:35:14,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:35:14,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:35:14,706 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 21:35:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:35:14,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 21:35:14,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:35:14,728 INFO L85 PathProgramCache]: Analyzing trace with hash 203947253, now seen corresponding path program 1 times [2022-12-13 21:35:14,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:35:14,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564125352] [2022-12-13 21:35:14,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:35:14,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:35:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:35:14,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:35:14,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:35:14,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564125352] [2022-12-13 21:35:14,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564125352] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:35:14,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:35:14,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:35:14,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382984682] [2022-12-13 21:35:14,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:35:14,824 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 21:35:14,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:35:14,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:35:14,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:35:14,853 INFO L87 Difference]: Start difference. First operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 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 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-12-13 21:35:14,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:35:14,885 INFO L93 Difference]: Finished difference Result 93 states and 166 transitions. [2022-12-13 21:35:14,887 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 166 transitions. [2022-12-13 21:35:14,890 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2022-12-13 21:35:14,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 83 states and 133 transitions. [2022-12-13 21:35:14,895 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2022-12-13 21:35:14,896 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 [2022-12-13 21:35:14,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 133 transitions. [2022-12-13 21:35:14,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:35:14,897 INFO L218 hiAutomatonCegarLoop]: Abstraction has 83 states and 133 transitions. [2022-12-13 21:35:14,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 133 transitions. [2022-12-13 21:35:14,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-12-13 21:35:14,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.6024096385542168) internal successors, (133), 82 states have internal predecessors, (133), 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-12-13 21:35:14,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 133 transitions. [2022-12-13 21:35:14,927 INFO L240 hiAutomatonCegarLoop]: Abstraction has 83 states and 133 transitions. [2022-12-13 21:35:14,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:35:14,931 INFO L428 stractBuchiCegarLoop]: Abstraction has 83 states and 133 transitions. [2022-12-13 21:35:14,932 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-12-13 21:35:14,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 133 transitions. [2022-12-13 21:35:14,933 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2022-12-13 21:35:14,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 21:35:14,934 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 21:35:14,934 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 21:35:14,934 INFO L149 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] [2022-12-13 21:35:14,934 INFO L748 eck$LassoCheckResult]: Stem: 198#$Ultimate##0 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(16, 2);call #Ultimate.allocInit(12, 3); 156#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_~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_~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;havoc main_~cond~0#1; 157#L197-1 [2022-12-13 21:35:14,935 INFO L750 eck$LassoCheckResult]: Loop: 157#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 199#L52 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; 200#L83 assume !(0 != main_~p1~0#1); 174#L83-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 163#L87-1 assume !(0 != main_~p3~0#1); 150#L91-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 151#L95-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 175#L99-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 164#L103-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 165#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 172#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 173#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 192#L119-1 assume !(0 != main_~p11~0#1); 193#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 184#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 185#L131-1 assume !(0 != main_~p1~0#1); 169#L137-1 assume !(0 != main_~p2~0#1); 158#L142-1 assume !(0 != main_~p3~0#1); 160#L147-1 assume !(0 != main_~p4~0#1); 162#L152-1 assume !(0 != main_~p5~0#1); 215#L157-1 assume !(0 != main_~p6~0#1); 213#L162-1 assume !(0 != main_~p7~0#1); 211#L167-1 assume !(0 != main_~p8~0#1); 208#L172-1 assume !(0 != main_~p9~0#1); 207#L177-1 assume !(0 != main_~p10~0#1); 205#L182-1 assume !(0 != main_~p11~0#1); 201#L187-1 assume !(0 != main_~p12~0#1); 187#L192-1 assume !(0 != main_~p13~0#1); 157#L197-1 [2022-12-13 21:35:14,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:35:14,935 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-12-13 21:35:14,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:35:14,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289781720] [2022-12-13 21:35:14,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:35:14,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:35:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:35:14,944 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 21:35:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:35:14,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 21:35:14,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:35:14,952 INFO L85 PathProgramCache]: Analyzing trace with hash 265986867, now seen corresponding path program 1 times [2022-12-13 21:35:14,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:35:14,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268574263] [2022-12-13 21:35:14,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:35:14,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:35:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:35:15,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:35:15,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:35:15,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268574263] [2022-12-13 21:35:15,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268574263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:35:15,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:35:15,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:35:15,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929585438] [2022-12-13 21:35:15,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:35:15,006 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 21:35:15,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:35:15,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:35:15,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:35:15,007 INFO L87 Difference]: Start difference. First operand 83 states and 133 transitions. cyclomatic complexity: 52 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-12-13 21:35:15,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:35:15,030 INFO L93 Difference]: Finished difference Result 162 states and 258 transitions. [2022-12-13 21:35:15,030 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162 states and 258 transitions. [2022-12-13 21:35:15,033 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 160 [2022-12-13 21:35:15,034 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162 states to 162 states and 258 transitions. [2022-12-13 21:35:15,034 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 162 [2022-12-13 21:35:15,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2022-12-13 21:35:15,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 162 states and 258 transitions. [2022-12-13 21:35:15,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:35:15,036 INFO L218 hiAutomatonCegarLoop]: Abstraction has 162 states and 258 transitions. [2022-12-13 21:35:15,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states and 258 transitions. [2022-12-13 21:35:15,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2022-12-13 21:35:15,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 162 states have (on average 1.5925925925925926) internal successors, (258), 161 states have internal predecessors, (258), 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-12-13 21:35:15,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 258 transitions. [2022-12-13 21:35:15,046 INFO L240 hiAutomatonCegarLoop]: Abstraction has 162 states and 258 transitions. [2022-12-13 21:35:15,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:35:15,047 INFO L428 stractBuchiCegarLoop]: Abstraction has 162 states and 258 transitions. [2022-12-13 21:35:15,047 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-12-13 21:35:15,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 162 states and 258 transitions. [2022-12-13 21:35:15,049 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 160 [2022-12-13 21:35:15,049 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 21:35:15,049 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 21:35:15,049 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 21:35:15,049 INFO L149 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] [2022-12-13 21:35:15,049 INFO L748 eck$LassoCheckResult]: Stem: 455#$Ultimate##0 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(16, 2);call #Ultimate.allocInit(12, 3); 407#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_~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_~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;havoc main_~cond~0#1; 406#L197-1 [2022-12-13 21:35:15,050 INFO L750 eck$LassoCheckResult]: Loop: 406#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 458#L52 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; 459#L83 assume !(0 != main_~p1~0#1); 510#L83-2 assume !(0 != main_~p2~0#1); 509#L87-1 assume !(0 != main_~p3~0#1); 508#L91-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 507#L95-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 506#L99-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 505#L103-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 504#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 503#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 502#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 501#L119-1 assume !(0 != main_~p11~0#1); 500#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 499#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 497#L131-1 assume !(0 != main_~p1~0#1); 496#L137-1 assume !(0 != main_~p2~0#1); 494#L142-1 assume !(0 != main_~p3~0#1); 493#L147-1 assume !(0 != main_~p4~0#1); 416#L152-1 assume !(0 != main_~p5~0#1); 417#L157-1 assume !(0 != main_~p6~0#1); 484#L162-1 assume !(0 != main_~p7~0#1); 483#L167-1 assume !(0 != main_~p8~0#1); 436#L172-1 assume !(0 != main_~p9~0#1); 437#L177-1 assume !(0 != main_~p10~0#1); 474#L182-1 assume !(0 != main_~p11~0#1); 473#L187-1 assume !(0 != main_~p12~0#1); 453#L192-1 assume !(0 != main_~p13~0#1); 406#L197-1 [2022-12-13 21:35:15,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:35:15,050 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-12-13 21:35:15,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:35:15,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289824592] [2022-12-13 21:35:15,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:35:15,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:35:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:35:15,055 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 21:35:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:35:15,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 21:35:15,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:35:15,063 INFO L85 PathProgramCache]: Analyzing trace with hash 406535477, now seen corresponding path program 1 times [2022-12-13 21:35:15,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:35:15,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764805397] [2022-12-13 21:35:15,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:35:15,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:35:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:35:15,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:35:15,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:35:15,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764805397] [2022-12-13 21:35:15,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764805397] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:35:15,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:35:15,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:35:15,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462759430] [2022-12-13 21:35:15,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:35:15,105 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 21:35:15,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:35:15,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:35:15,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:35:15,106 INFO L87 Difference]: Start difference. First operand 162 states and 258 transitions. cyclomatic complexity: 100 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-12-13 21:35:15,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:35:15,121 INFO L93 Difference]: Finished difference Result 318 states and 502 transitions. [2022-12-13 21:35:15,121 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 318 states and 502 transitions. [2022-12-13 21:35:15,124 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 316 [2022-12-13 21:35:15,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 318 states to 318 states and 502 transitions. [2022-12-13 21:35:15,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 318 [2022-12-13 21:35:15,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 318 [2022-12-13 21:35:15,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 318 states and 502 transitions. [2022-12-13 21:35:15,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:35:15,128 INFO L218 hiAutomatonCegarLoop]: Abstraction has 318 states and 502 transitions. [2022-12-13 21:35:15,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states and 502 transitions. [2022-12-13 21:35:15,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2022-12-13 21:35:15,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 318 states have (on average 1.578616352201258) internal successors, (502), 317 states have internal predecessors, (502), 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-12-13 21:35:15,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 502 transitions. [2022-12-13 21:35:15,145 INFO L240 hiAutomatonCegarLoop]: Abstraction has 318 states and 502 transitions. [2022-12-13 21:35:15,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:35:15,146 INFO L428 stractBuchiCegarLoop]: Abstraction has 318 states and 502 transitions. [2022-12-13 21:35:15,146 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-12-13 21:35:15,146 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 318 states and 502 transitions. [2022-12-13 21:35:15,148 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 316 [2022-12-13 21:35:15,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 21:35:15,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 21:35:15,149 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 21:35:15,149 INFO L149 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] [2022-12-13 21:35:15,149 INFO L748 eck$LassoCheckResult]: Stem: 942#$Ultimate##0 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(16, 2);call #Ultimate.allocInit(12, 3); 893#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_~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_~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;havoc main_~cond~0#1; 894#L197-1 [2022-12-13 21:35:15,149 INFO L750 eck$LassoCheckResult]: Loop: 894#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 993#L52 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; 991#L83 assume !(0 != main_~p1~0#1); 987#L83-2 assume !(0 != main_~p2~0#1); 985#L87-1 assume !(0 != main_~p3~0#1); 982#L91-1 assume !(0 != main_~p4~0#1); 980#L95-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 978#L99-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 976#L103-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 974#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 972#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 970#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 968#L119-1 assume !(0 != main_~p11~0#1); 966#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 964#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 961#L131-1 assume !(0 != main_~p1~0#1); 962#L137-1 assume !(0 != main_~p2~0#1); 1037#L142-1 assume !(0 != main_~p3~0#1); 1032#L147-1 assume !(0 != main_~p4~0#1); 1029#L152-1 assume !(0 != main_~p5~0#1); 1025#L157-1 assume !(0 != main_~p6~0#1); 1021#L162-1 assume !(0 != main_~p7~0#1); 1017#L167-1 assume !(0 != main_~p8~0#1); 1012#L172-1 assume !(0 != main_~p9~0#1); 1009#L177-1 assume !(0 != main_~p10~0#1); 1005#L182-1 assume !(0 != main_~p11~0#1); 1000#L187-1 assume !(0 != main_~p12~0#1); 997#L192-1 assume !(0 != main_~p13~0#1); 894#L197-1 [2022-12-13 21:35:15,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:35:15,150 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-12-13 21:35:15,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:35:15,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737676383] [2022-12-13 21:35:15,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:35:15,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:35:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:35:15,155 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 21:35:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:35:15,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 21:35:15,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:35:15,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1398902857, now seen corresponding path program 1 times [2022-12-13 21:35:15,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:35:15,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165338001] [2022-12-13 21:35:15,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:35:15,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:35:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:35:15,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:35:15,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:35:15,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165338001] [2022-12-13 21:35:15,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165338001] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:35:15,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:35:15,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:35:15,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791059136] [2022-12-13 21:35:15,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:35:15,195 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 21:35:15,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:35:15,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:35:15,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:35:15,196 INFO L87 Difference]: Start difference. First operand 318 states and 502 transitions. cyclomatic complexity: 192 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-12-13 21:35:15,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:35:15,214 INFO L93 Difference]: Finished difference Result 626 states and 978 transitions. [2022-12-13 21:35:15,214 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 626 states and 978 transitions. [2022-12-13 21:35:15,220 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 624 [2022-12-13 21:35:15,223 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 626 states to 626 states and 978 transitions. [2022-12-13 21:35:15,224 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 626 [2022-12-13 21:35:15,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 626 [2022-12-13 21:35:15,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 626 states and 978 transitions. [2022-12-13 21:35:15,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:35:15,227 INFO L218 hiAutomatonCegarLoop]: Abstraction has 626 states and 978 transitions. [2022-12-13 21:35:15,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states and 978 transitions. [2022-12-13 21:35:15,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2022-12-13 21:35:15,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 626 states have (on average 1.5623003194888179) internal successors, (978), 625 states have internal predecessors, (978), 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-12-13 21:35:15,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 978 transitions. [2022-12-13 21:35:15,247 INFO L240 hiAutomatonCegarLoop]: Abstraction has 626 states and 978 transitions. [2022-12-13 21:35:15,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:35:15,248 INFO L428 stractBuchiCegarLoop]: Abstraction has 626 states and 978 transitions. [2022-12-13 21:35:15,248 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-12-13 21:35:15,248 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 626 states and 978 transitions. [2022-12-13 21:35:15,251 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 624 [2022-12-13 21:35:15,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 21:35:15,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 21:35:15,252 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 21:35:15,252 INFO L149 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] [2022-12-13 21:35:15,252 INFO L748 eck$LassoCheckResult]: Stem: 1883#$Ultimate##0 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(16, 2);call #Ultimate.allocInit(12, 3); 1843#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_~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_~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;havoc main_~cond~0#1; 1844#L197-1 [2022-12-13 21:35:15,252 INFO L750 eck$LassoCheckResult]: Loop: 1844#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 1941#L52 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; 1939#L83 assume !(0 != main_~p1~0#1); 1935#L83-2 assume !(0 != main_~p2~0#1); 1933#L87-1 assume !(0 != main_~p3~0#1); 1929#L91-1 assume !(0 != main_~p4~0#1); 1925#L95-1 assume !(0 != main_~p5~0#1); 1923#L99-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1921#L103-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1919#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1917#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1915#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1913#L119-1 assume !(0 != main_~p11~0#1); 1911#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1909#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 1906#L131-1 assume !(0 != main_~p1~0#1); 1907#L137-1 assume !(0 != main_~p2~0#1); 1984#L142-1 assume !(0 != main_~p3~0#1); 1980#L147-1 assume !(0 != main_~p4~0#1); 1976#L152-1 assume !(0 != main_~p5~0#1); 1973#L157-1 assume !(0 != main_~p6~0#1); 1969#L162-1 assume !(0 != main_~p7~0#1); 1965#L167-1 assume !(0 != main_~p8~0#1); 1960#L172-1 assume !(0 != main_~p9~0#1); 1957#L177-1 assume !(0 != main_~p10~0#1); 1953#L182-1 assume !(0 != main_~p11~0#1); 1948#L187-1 assume !(0 != main_~p12~0#1); 1945#L192-1 assume !(0 != main_~p13~0#1); 1844#L197-1 [2022-12-13 21:35:15,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:35:15,253 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-12-13 21:35:15,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:35:15,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071742181] [2022-12-13 21:35:15,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:35:15,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:35:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:35:15,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 21:35:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:35:15,263 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 21:35:15,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:35:15,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1180048139, now seen corresponding path program 1 times [2022-12-13 21:35:15,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:35:15,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697966564] [2022-12-13 21:35:15,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:35:15,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:35:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:35:15,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:35:15,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:35:15,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697966564] [2022-12-13 21:35:15,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697966564] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:35:15,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:35:15,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:35:15,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559243802] [2022-12-13 21:35:15,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:35:15,293 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 21:35:15,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:35:15,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:35:15,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:35:15,294 INFO L87 Difference]: Start difference. First operand 626 states and 978 transitions. cyclomatic complexity: 368 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-12-13 21:35:15,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:35:15,310 INFO L93 Difference]: Finished difference Result 1234 states and 1906 transitions. [2022-12-13 21:35:15,310 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1234 states and 1906 transitions. [2022-12-13 21:35:15,319 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1232 [2022-12-13 21:35:15,338 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1234 states to 1234 states and 1906 transitions. [2022-12-13 21:35:15,338 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1234 [2022-12-13 21:35:15,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1234 [2022-12-13 21:35:15,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1234 states and 1906 transitions. [2022-12-13 21:35:15,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:35:15,341 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2022-12-13 21:35:15,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states and 1906 transitions. [2022-12-13 21:35:15,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1234. [2022-12-13 21:35:15,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 1234 states have (on average 1.5445705024311183) internal successors, (1906), 1233 states have internal predecessors, (1906), 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-12-13 21:35:15,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 1906 transitions. [2022-12-13 21:35:15,374 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2022-12-13 21:35:15,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:35:15,376 INFO L428 stractBuchiCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2022-12-13 21:35:15,376 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-12-13 21:35:15,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1234 states and 1906 transitions. [2022-12-13 21:35:15,383 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1232 [2022-12-13 21:35:15,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 21:35:15,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 21:35:15,384 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 21:35:15,384 INFO L149 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] [2022-12-13 21:35:15,384 INFO L748 eck$LassoCheckResult]: Stem: 3759#$Ultimate##0 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(16, 2);call #Ultimate.allocInit(12, 3); 3709#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_~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_~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;havoc main_~cond~0#1; 3710#L197-1 [2022-12-13 21:35:15,384 INFO L750 eck$LassoCheckResult]: Loop: 3710#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 3850#L52 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; 3846#L83 assume !(0 != main_~p1~0#1); 3839#L83-2 assume !(0 != main_~p2~0#1); 3834#L87-1 assume !(0 != main_~p3~0#1); 3827#L91-1 assume !(0 != main_~p4~0#1); 3819#L95-1 assume !(0 != main_~p5~0#1); 3813#L99-1 assume !(0 != main_~p6~0#1); 3808#L103-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 3805#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 3802#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 3799#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 3796#L119-1 assume !(0 != main_~p11~0#1); 3793#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 3789#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 3790#L131-1 assume !(0 != main_~p1~0#1); 3917#L137-1 assume !(0 != main_~p2~0#1); 3913#L142-1 assume !(0 != main_~p3~0#1); 3903#L147-1 assume !(0 != main_~p4~0#1); 3898#L152-1 assume !(0 != main_~p5~0#1); 3896#L157-1 assume !(0 != main_~p6~0#1); 3895#L162-1 assume !(0 != main_~p7~0#1); 3893#L167-1 assume !(0 != main_~p8~0#1); 3886#L172-1 assume !(0 != main_~p9~0#1); 3875#L177-1 assume !(0 != main_~p10~0#1); 3867#L182-1 assume !(0 != main_~p11~0#1); 3862#L187-1 assume !(0 != main_~p12~0#1); 3859#L192-1 assume !(0 != main_~p13~0#1); 3710#L197-1 [2022-12-13 21:35:15,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:35:15,385 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-12-13 21:35:15,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:35:15,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188140367] [2022-12-13 21:35:15,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:35:15,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:35:15,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:35:15,391 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 21:35:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:35:15,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 21:35:15,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:35:15,397 INFO L85 PathProgramCache]: Analyzing trace with hash -757346313, now seen corresponding path program 1 times [2022-12-13 21:35:15,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:35:15,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971063498] [2022-12-13 21:35:15,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:35:15,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:35:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:35:15,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:35:15,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:35:15,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971063498] [2022-12-13 21:35:15,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971063498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:35:15,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:35:15,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:35:15,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495052791] [2022-12-13 21:35:15,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:35:15,427 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 21:35:15,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:35:15,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:35:15,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:35:15,428 INFO L87 Difference]: Start difference. First operand 1234 states and 1906 transitions. cyclomatic complexity: 704 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-12-13 21:35:15,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:35:15,453 INFO L93 Difference]: Finished difference Result 2434 states and 3714 transitions. [2022-12-13 21:35:15,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2434 states and 3714 transitions. [2022-12-13 21:35:15,480 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2432 [2022-12-13 21:35:15,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2434 states to 2434 states and 3714 transitions. [2022-12-13 21:35:15,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2434 [2022-12-13 21:35:15,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2434 [2022-12-13 21:35:15,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2434 states and 3714 transitions. [2022-12-13 21:35:15,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:35:15,504 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2022-12-13 21:35:15,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states and 3714 transitions. [2022-12-13 21:35:15,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2434. [2022-12-13 21:35:15,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 2434 states have (on average 1.5258833196384551) internal successors, (3714), 2433 states have internal predecessors, (3714), 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-12-13 21:35:15,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 3714 transitions. [2022-12-13 21:35:15,535 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2022-12-13 21:35:15,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:35:15,536 INFO L428 stractBuchiCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2022-12-13 21:35:15,536 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-12-13 21:35:15,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2434 states and 3714 transitions. [2022-12-13 21:35:15,543 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2432 [2022-12-13 21:35:15,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 21:35:15,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 21:35:15,543 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 21:35:15,543 INFO L149 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] [2022-12-13 21:35:15,544 INFO L748 eck$LassoCheckResult]: Stem: 7429#$Ultimate##0 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(16, 2);call #Ultimate.allocInit(12, 3); 7383#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_~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_~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;havoc main_~cond~0#1; 7384#L197-1 [2022-12-13 21:35:15,544 INFO L750 eck$LassoCheckResult]: Loop: 7384#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 7751#L52 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; 7749#L83 assume !(0 != main_~p1~0#1); 7746#L83-2 assume !(0 != main_~p2~0#1); 7743#L87-1 assume !(0 != main_~p3~0#1); 7740#L91-1 assume !(0 != main_~p4~0#1); 7736#L95-1 assume !(0 != main_~p5~0#1); 7737#L99-1 assume !(0 != main_~p6~0#1); 7617#L103-1 assume !(0 != main_~p7~0#1); 7614#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 7611#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 7608#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 7605#L119-1 assume !(0 != main_~p11~0#1); 7602#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 7598#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 7599#L131-1 assume !(0 != main_~p1~0#1); 7723#L137-1 assume !(0 != main_~p2~0#1); 7588#L142-1 assume !(0 != main_~p3~0#1); 7582#L147-1 assume !(0 != main_~p4~0#1); 7584#L152-1 assume !(0 != main_~p5~0#1); 7807#L157-1 assume !(0 != main_~p6~0#1); 7803#L162-1 assume !(0 != main_~p7~0#1); 7799#L167-1 assume !(0 != main_~p8~0#1); 7792#L172-1 assume !(0 != main_~p9~0#1); 7789#L177-1 assume !(0 != main_~p10~0#1); 7785#L182-1 assume !(0 != main_~p11~0#1); 7779#L187-1 assume !(0 != main_~p12~0#1); 7765#L192-1 assume !(0 != main_~p13~0#1); 7384#L197-1 [2022-12-13 21:35:15,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:35:15,544 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2022-12-13 21:35:15,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:35:15,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336204493] [2022-12-13 21:35:15,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:35:15,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:35:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:35:15,547 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 21:35:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:35:15,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 21:35:15,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:35:15,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1574994763, now seen corresponding path program 1 times [2022-12-13 21:35:15,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:35:15,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047155797] [2022-12-13 21:35:15,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:35:15,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:35:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:35:15,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:35:15,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:35:15,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047155797] [2022-12-13 21:35:15,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047155797] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:35:15,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:35:15,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:35:15,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110732339] [2022-12-13 21:35:15,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:35:15,568 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 21:35:15,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:35:15,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:35:15,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:35:15,569 INFO L87 Difference]: Start difference. First operand 2434 states and 3714 transitions. cyclomatic complexity: 1344 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-12-13 21:35:15,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:35:15,592 INFO L93 Difference]: Finished difference Result 4802 states and 7234 transitions. [2022-12-13 21:35:15,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4802 states and 7234 transitions. [2022-12-13 21:35:15,619 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4800 [2022-12-13 21:35:15,631 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4802 states to 4802 states and 7234 transitions. [2022-12-13 21:35:15,631 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4802 [2022-12-13 21:35:15,633 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4802 [2022-12-13 21:35:15,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4802 states and 7234 transitions. [2022-12-13 21:35:15,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:35:15,638 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2022-12-13 21:35:15,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4802 states and 7234 transitions. [2022-12-13 21:35:15,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4802 to 4802. [2022-12-13 21:35:15,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4802 states, 4802 states have (on average 1.5064556434818825) internal successors, (7234), 4801 states have internal predecessors, (7234), 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-12-13 21:35:15,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4802 states to 4802 states and 7234 transitions. [2022-12-13 21:35:15,750 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2022-12-13 21:35:15,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:35:15,752 INFO L428 stractBuchiCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2022-12-13 21:35:15,752 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-12-13 21:35:15,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4802 states and 7234 transitions. [2022-12-13 21:35:15,779 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4800 [2022-12-13 21:35:15,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 21:35:15,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 21:35:15,780 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 21:35:15,780 INFO L149 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] [2022-12-13 21:35:15,780 INFO L748 eck$LassoCheckResult]: Stem: 14673#$Ultimate##0 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(16, 2);call #Ultimate.allocInit(12, 3); 14625#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_~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_~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;havoc main_~cond~0#1; 14626#L197-1 [2022-12-13 21:35:15,780 INFO L750 eck$LassoCheckResult]: Loop: 14626#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 15202#L52 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; 15201#L83 assume !(0 != main_~p1~0#1); 15066#L83-2 assume !(0 != main_~p2~0#1); 15068#L87-1 assume !(0 != main_~p3~0#1); 15048#L91-1 assume !(0 != main_~p4~0#1); 15049#L95-1 assume !(0 != main_~p5~0#1); 15233#L99-1 assume !(0 != main_~p6~0#1); 15231#L103-1 assume !(0 != main_~p7~0#1); 15228#L107-1 assume !(0 != main_~p8~0#1); 15226#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 15224#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 15223#L119-1 assume !(0 != main_~p11~0#1); 15222#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 15220#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 15196#L131-1 assume !(0 != main_~p1~0#1); 15197#L137-1 assume !(0 != main_~p2~0#1); 15186#L142-1 assume !(0 != main_~p3~0#1); 15185#L147-1 assume !(0 != main_~p4~0#1); 15303#L152-1 assume !(0 != main_~p5~0#1); 15299#L157-1 assume !(0 != main_~p6~0#1); 15296#L162-1 assume !(0 != main_~p7~0#1); 15291#L167-1 assume !(0 != main_~p8~0#1); 15286#L172-1 assume !(0 != main_~p9~0#1); 15282#L177-1 assume !(0 != main_~p10~0#1); 15278#L182-1 assume !(0 != main_~p11~0#1); 15209#L187-1 assume !(0 != main_~p12~0#1); 15206#L192-1 assume !(0 != main_~p13~0#1); 14626#L197-1 [2022-12-13 21:35:15,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:35:15,781 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2022-12-13 21:35:15,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:35:15,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584918354] [2022-12-13 21:35:15,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:35:15,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:35:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:35:15,786 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 21:35:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:35:15,791 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 21:35:15,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:35:15,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1031028791, now seen corresponding path program 1 times [2022-12-13 21:35:15,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:35:15,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662778337] [2022-12-13 21:35:15,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:35:15,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:35:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:35:15,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:35:15,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:35:15,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662778337] [2022-12-13 21:35:15,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662778337] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:35:15,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:35:15,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:35:15,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763082110] [2022-12-13 21:35:15,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:35:15,817 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 21:35:15,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:35:15,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:35:15,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:35:15,817 INFO L87 Difference]: Start difference. First operand 4802 states and 7234 transitions. cyclomatic complexity: 2560 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-12-13 21:35:15,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:35:15,867 INFO L93 Difference]: Finished difference Result 9474 states and 14082 transitions. [2022-12-13 21:35:15,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9474 states and 14082 transitions. [2022-12-13 21:35:15,920 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 9472 [2022-12-13 21:35:15,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9474 states to 9474 states and 14082 transitions. [2022-12-13 21:35:15,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9474 [2022-12-13 21:35:15,979 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9474 [2022-12-13 21:35:15,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9474 states and 14082 transitions. [2022-12-13 21:35:15,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:35:15,993 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2022-12-13 21:35:16,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9474 states and 14082 transitions. [2022-12-13 21:35:16,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9474 to 9474. [2022-12-13 21:35:16,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9474 states, 9474 states have (on average 1.486383787207093) internal successors, (14082), 9473 states have internal predecessors, (14082), 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-12-13 21:35:16,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9474 states to 9474 states and 14082 transitions. [2022-12-13 21:35:16,185 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2022-12-13 21:35:16,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:35:16,186 INFO L428 stractBuchiCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2022-12-13 21:35:16,186 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-12-13 21:35:16,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9474 states and 14082 transitions. [2022-12-13 21:35:16,214 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 9472 [2022-12-13 21:35:16,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 21:35:16,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 21:35:16,215 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 21:35:16,215 INFO L149 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] [2022-12-13 21:35:16,215 INFO L748 eck$LassoCheckResult]: Stem: 28952#$Ultimate##0 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(16, 2);call #Ultimate.allocInit(12, 3); 28907#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_~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_~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;havoc main_~cond~0#1; 28908#L197-1 [2022-12-13 21:35:16,215 INFO L750 eck$LassoCheckResult]: Loop: 28908#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 29474#L52 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; 29467#L83 assume !(0 != main_~p1~0#1); 29460#L83-2 assume !(0 != main_~p2~0#1); 29461#L87-1 assume !(0 != main_~p3~0#1); 29569#L91-1 assume !(0 != main_~p4~0#1); 29566#L95-1 assume !(0 != main_~p5~0#1); 29563#L99-1 assume !(0 != main_~p6~0#1); 29441#L103-1 assume !(0 != main_~p7~0#1); 29443#L107-1 assume !(0 != main_~p8~0#1); 29429#L111-1 assume !(0 != main_~p9~0#1); 29431#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 29420#L119-1 assume !(0 != main_~p11~0#1); 29421#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 29412#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 29413#L131-1 assume !(0 != main_~p1~0#1); 29549#L137-1 assume !(0 != main_~p2~0#1); 29547#L142-1 assume !(0 != main_~p3~0#1); 29544#L147-1 assume !(0 != main_~p4~0#1); 29542#L152-1 assume !(0 != main_~p5~0#1); 29540#L157-1 assume !(0 != main_~p6~0#1); 29538#L162-1 assume !(0 != main_~p7~0#1); 29530#L167-1 assume !(0 != main_~p8~0#1); 29524#L172-1 assume !(0 != main_~p9~0#1); 29515#L177-1 assume !(0 != main_~p10~0#1); 29507#L182-1 assume !(0 != main_~p11~0#1); 29490#L187-1 assume !(0 != main_~p12~0#1); 29483#L192-1 assume !(0 != main_~p13~0#1); 28908#L197-1 [2022-12-13 21:35:16,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:35:16,216 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2022-12-13 21:35:16,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:35:16,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583769500] [2022-12-13 21:35:16,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:35:16,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:35:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:35:16,220 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 21:35:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:35:16,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 21:35:16,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:35:16,225 INFO L85 PathProgramCache]: Analyzing trace with hash -963115915, now seen corresponding path program 1 times [2022-12-13 21:35:16,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:35:16,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727729781] [2022-12-13 21:35:16,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:35:16,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:35:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:35:16,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:35:16,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:35:16,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727729781] [2022-12-13 21:35:16,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727729781] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:35:16,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:35:16,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:35:16,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632723620] [2022-12-13 21:35:16,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:35:16,247 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 21:35:16,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:35:16,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:35:16,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:35:16,248 INFO L87 Difference]: Start difference. First operand 9474 states and 14082 transitions. cyclomatic complexity: 4864 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-12-13 21:35:16,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:35:16,323 INFO L93 Difference]: Finished difference Result 18690 states and 27394 transitions. [2022-12-13 21:35:16,323 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18690 states and 27394 transitions. [2022-12-13 21:35:16,399 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 18688 [2022-12-13 21:35:16,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18690 states to 18690 states and 27394 transitions. [2022-12-13 21:35:16,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18690 [2022-12-13 21:35:16,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18690 [2022-12-13 21:35:16,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18690 states and 27394 transitions. [2022-12-13 21:35:16,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:35:16,482 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2022-12-13 21:35:16,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18690 states and 27394 transitions. [2022-12-13 21:35:16,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18690 to 18690. [2022-12-13 21:35:16,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18690 states, 18690 states have (on average 1.4657035848047084) internal successors, (27394), 18689 states have internal predecessors, (27394), 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-12-13 21:35:16,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18690 states to 18690 states and 27394 transitions. [2022-12-13 21:35:16,785 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2022-12-13 21:35:16,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:35:16,786 INFO L428 stractBuchiCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2022-12-13 21:35:16,787 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-12-13 21:35:16,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18690 states and 27394 transitions. [2022-12-13 21:35:16,866 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 18688 [2022-12-13 21:35:16,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 21:35:16,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 21:35:16,866 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 21:35:16,866 INFO L149 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] [2022-12-13 21:35:16,867 INFO L748 eck$LassoCheckResult]: Stem: 57127#$Ultimate##0 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(16, 2);call #Ultimate.allocInit(12, 3); 57077#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_~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_~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;havoc main_~cond~0#1; 57078#L197-1 [2022-12-13 21:35:16,867 INFO L750 eck$LassoCheckResult]: Loop: 57078#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 57243#L52 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; 57239#L83 assume !(0 != main_~p1~0#1); 57236#L83-2 assume !(0 != main_~p2~0#1); 57233#L87-1 assume !(0 != main_~p3~0#1); 57229#L91-1 assume !(0 != main_~p4~0#1); 57225#L95-1 assume !(0 != main_~p5~0#1); 57221#L99-1 assume !(0 != main_~p6~0#1); 57216#L103-1 assume !(0 != main_~p7~0#1); 57212#L107-1 assume !(0 != main_~p8~0#1); 57185#L111-1 assume !(0 != main_~p9~0#1); 57187#L115-1 assume !(0 != main_~p10~0#1); 57625#L119-1 assume !(0 != main_~p11~0#1); 57641#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 57638#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 57602#L131-1 assume !(0 != main_~p1~0#1); 57599#L137-1 assume !(0 != main_~p2~0#1); 57557#L142-1 assume !(0 != main_~p3~0#1); 57477#L147-1 assume !(0 != main_~p4~0#1); 57474#L152-1 assume !(0 != main_~p5~0#1); 57471#L157-1 assume !(0 != main_~p6~0#1); 57468#L162-1 assume !(0 != main_~p7~0#1); 57466#L167-1 assume !(0 != main_~p8~0#1); 57463#L172-1 assume !(0 != main_~p9~0#1); 57458#L177-1 assume !(0 != main_~p10~0#1); 57455#L182-1 assume !(0 != main_~p11~0#1); 57249#L187-1 assume !(0 != main_~p12~0#1); 57248#L192-1 assume !(0 != main_~p13~0#1); 57078#L197-1 [2022-12-13 21:35:16,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:35:16,867 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2022-12-13 21:35:16,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:35:16,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035643069] [2022-12-13 21:35:16,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:35:16,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:35:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:35:16,872 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 21:35:16,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:35:16,876 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 21:35:16,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:35:16,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1743503479, now seen corresponding path program 1 times [2022-12-13 21:35:16,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:35:16,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161145905] [2022-12-13 21:35:16,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:35:16,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:35:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:35:16,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:35:16,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:35:16,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161145905] [2022-12-13 21:35:16,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161145905] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:35:16,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:35:16,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:35:16,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470792817] [2022-12-13 21:35:16,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:35:16,898 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 21:35:16,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:35:16,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:35:16,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:35:16,899 INFO L87 Difference]: Start difference. First operand 18690 states and 27394 transitions. cyclomatic complexity: 9216 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-12-13 21:35:17,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:35:17,014 INFO L93 Difference]: Finished difference Result 36866 states and 53250 transitions. [2022-12-13 21:35:17,014 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36866 states and 53250 transitions. [2022-12-13 21:35:17,185 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 36864 [2022-12-13 21:35:17,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36866 states to 36866 states and 53250 transitions. [2022-12-13 21:35:17,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36866 [2022-12-13 21:35:17,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36866 [2022-12-13 21:35:17,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36866 states and 53250 transitions. [2022-12-13 21:35:17,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:35:17,294 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36866 states and 53250 transitions. [2022-12-13 21:35:17,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36866 states and 53250 transitions. [2022-12-13 21:35:17,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36866 to 36866. [2022-12-13 21:35:17,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36866 states, 36866 states have (on average 1.4444203330982477) internal successors, (53250), 36865 states have internal predecessors, (53250), 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-12-13 21:35:17,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36866 states to 36866 states and 53250 transitions. [2022-12-13 21:35:17,658 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36866 states and 53250 transitions. [2022-12-13 21:35:17,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:35:17,659 INFO L428 stractBuchiCegarLoop]: Abstraction has 36866 states and 53250 transitions. [2022-12-13 21:35:17,659 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-12-13 21:35:17,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36866 states and 53250 transitions. [2022-12-13 21:35:17,729 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 36864 [2022-12-13 21:35:17,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 21:35:17,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 21:35:17,730 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 21:35:17,730 INFO L149 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] [2022-12-13 21:35:17,730 INFO L748 eck$LassoCheckResult]: Stem: 112689#$Ultimate##0 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(16, 2);call #Ultimate.allocInit(12, 3); 112639#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_~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_~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;havoc main_~cond~0#1; 112640#L197-1 [2022-12-13 21:35:17,730 INFO L750 eck$LassoCheckResult]: Loop: 112640#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 112879#L52 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; 112875#L83 assume !(0 != main_~p1~0#1); 112871#L83-2 assume !(0 != main_~p2~0#1); 112869#L87-1 assume !(0 != main_~p3~0#1); 112865#L91-1 assume !(0 != main_~p4~0#1); 112861#L95-1 assume !(0 != main_~p5~0#1); 112857#L99-1 assume !(0 != main_~p6~0#1); 112850#L103-1 assume !(0 != main_~p7~0#1); 112848#L107-1 assume !(0 != main_~p8~0#1); 112849#L111-1 assume !(0 != main_~p9~0#1); 112934#L115-1 assume !(0 != main_~p10~0#1); 112932#L119-1 assume !(0 != main_~p11~0#1); 112930#L123-1 assume !(0 != main_~p12~0#1); 112928#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 112924#L131-1 assume !(0 != main_~p1~0#1); 112920#L137-1 assume !(0 != main_~p2~0#1); 112917#L142-1 assume !(0 != main_~p3~0#1); 112912#L147-1 assume !(0 != main_~p4~0#1); 112908#L152-1 assume !(0 != main_~p5~0#1); 112904#L157-1 assume !(0 != main_~p6~0#1); 112900#L162-1 assume !(0 != main_~p7~0#1); 112896#L167-1 assume !(0 != main_~p8~0#1); 112892#L172-1 assume !(0 != main_~p9~0#1); 112823#L177-1 assume !(0 != main_~p10~0#1); 112819#L182-1 assume !(0 != main_~p11~0#1); 112818#L187-1 assume !(0 != main_~p12~0#1); 112883#L192-1 assume !(0 != main_~p13~0#1); 112640#L197-1 [2022-12-13 21:35:17,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:35:17,730 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2022-12-13 21:35:17,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:35:17,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52561059] [2022-12-13 21:35:17,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:35:17,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:35:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:35:17,734 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 21:35:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:35:17,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 21:35:17,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:35:17,737 INFO L85 PathProgramCache]: Analyzing trace with hash 463639801, now seen corresponding path program 1 times [2022-12-13 21:35:17,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:35:17,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981370902] [2022-12-13 21:35:17,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:35:17,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:35:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:35:17,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:35:17,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:35:17,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981370902] [2022-12-13 21:35:17,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981370902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:35:17,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:35:17,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:35:17,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570028688] [2022-12-13 21:35:17,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:35:17,753 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 21:35:17,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:35:17,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:35:17,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:35:17,754 INFO L87 Difference]: Start difference. First operand 36866 states and 53250 transitions. cyclomatic complexity: 17408 Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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-12-13 21:35:17,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:35:17,987 INFO L93 Difference]: Finished difference Result 72706 states and 103426 transitions. [2022-12-13 21:35:17,987 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72706 states and 103426 transitions. [2022-12-13 21:35:18,270 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 72704 [2022-12-13 21:35:18,443 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72706 states to 72706 states and 103426 transitions. [2022-12-13 21:35:18,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72706 [2022-12-13 21:35:18,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72706 [2022-12-13 21:35:18,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72706 states and 103426 transitions. [2022-12-13 21:35:18,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:35:18,519 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72706 states and 103426 transitions. [2022-12-13 21:35:18,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72706 states and 103426 transitions. [2022-12-13 21:35:19,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72706 to 72706. [2022-12-13 21:35:19,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72706 states, 72706 states have (on average 1.4225235881495337) internal successors, (103426), 72705 states have internal predecessors, (103426), 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-12-13 21:35:19,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72706 states to 72706 states and 103426 transitions. [2022-12-13 21:35:19,368 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72706 states and 103426 transitions. [2022-12-13 21:35:19,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:35:19,369 INFO L428 stractBuchiCegarLoop]: Abstraction has 72706 states and 103426 transitions. [2022-12-13 21:35:19,369 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-12-13 21:35:19,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72706 states and 103426 transitions. [2022-12-13 21:35:19,531 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 72704 [2022-12-13 21:35:19,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 21:35:19,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 21:35:19,532 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 21:35:19,532 INFO L149 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] [2022-12-13 21:35:19,532 INFO L748 eck$LassoCheckResult]: Stem: 222269#$Ultimate##0 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(16, 2);call #Ultimate.allocInit(12, 3); 222217#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_~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_~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;havoc main_~cond~0#1; 222218#L197-1 [2022-12-13 21:35:19,532 INFO L750 eck$LassoCheckResult]: Loop: 222218#L197-1 assume !false;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 222932#L52 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; 222933#L83 assume !(0 != main_~p1~0#1); 222926#L83-2 assume !(0 != main_~p2~0#1); 222928#L87-1 assume !(0 != main_~p3~0#1); 222921#L91-1 assume !(0 != main_~p4~0#1); 222923#L95-1 assume !(0 != main_~p5~0#1); 222985#L99-1 assume !(0 != main_~p6~0#1); 222982#L103-1 assume !(0 != main_~p7~0#1); 222978#L107-1 assume !(0 != main_~p8~0#1); 222974#L111-1 assume !(0 != main_~p9~0#1); 222975#L115-1 assume !(0 != main_~p10~0#1); 222781#L119-1 assume !(0 != main_~p11~0#1); 222782#L123-1 assume !(0 != main_~p12~0#1); 222765#L127-1 assume !(0 != main_~p13~0#1); 222767#L131-1 assume !(0 != main_~p1~0#1); 223196#L137-1 assume !(0 != main_~p2~0#1); 224222#L142-1 assume !(0 != main_~p3~0#1); 222453#L147-1 assume !(0 != main_~p4~0#1); 222455#L152-1 assume !(0 != main_~p5~0#1); 222871#L157-1 assume !(0 != main_~p6~0#1); 222872#L162-1 assume !(0 != main_~p7~0#1); 222860#L167-1 assume !(0 != main_~p8~0#1); 222861#L172-1 assume !(0 != main_~p9~0#1); 222947#L177-1 assume !(0 != main_~p10~0#1); 222943#L182-1 assume !(0 != main_~p11~0#1); 222942#L187-1 assume !(0 != main_~p12~0#1); 222936#L192-1 assume !(0 != main_~p13~0#1); 222218#L197-1 [2022-12-13 21:35:19,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:35:19,532 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2022-12-13 21:35:19,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:35:19,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490667869] [2022-12-13 21:35:19,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:35:19,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:35:19,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:35:19,536 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 21:35:19,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:35:19,539 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 21:35:19,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:35:19,539 INFO L85 PathProgramCache]: Analyzing trace with hash -547477449, now seen corresponding path program 1 times [2022-12-13 21:35:19,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:35:19,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083492780] [2022-12-13 21:35:19,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:35:19,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:35:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:35:19,545 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 21:35:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:35:19,553 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 21:35:19,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:35:19,553 INFO L85 PathProgramCache]: Analyzing trace with hash 496424185, now seen corresponding path program 1 times [2022-12-13 21:35:19,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:35:19,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989949763] [2022-12-13 21:35:19,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:35:19,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:35:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:35:19,558 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 21:35:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:35:19,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 21:35:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:35:19,967 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 21:35:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:35:20,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.12 09:35:20 BoogieIcfgContainer [2022-12-13 21:35:20,002 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-12-13 21:35:20,002 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 21:35:20,002 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 21:35:20,002 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 21:35:20,003 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:35:14" (3/4) ... [2022-12-13 21:35:20,005 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-12-13 21:35:20,044 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d63a95a-6c11-40f6-a2b4-86a13f230a85/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 21:35:20,044 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 21:35:20,045 INFO L158 Benchmark]: Toolchain (without parser) took 6016.92ms. Allocated memory was 132.1MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 95.9MB in the beginning and 487.9MB in the end (delta: -392.0MB). Peak memory consumption was 634.6MB. Max. memory is 16.1GB. [2022-12-13 21:35:20,045 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 132.1MB. Free memory is still 102.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 21:35:20,045 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.72ms. Allocated memory is still 132.1MB. Free memory was 95.5MB in the beginning and 84.5MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 21:35:20,046 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.79ms. Allocated memory is still 132.1MB. Free memory was 84.5MB in the beginning and 82.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 21:35:20,046 INFO L158 Benchmark]: Boogie Preprocessor took 17.60ms. Allocated memory is still 132.1MB. Free memory was 82.7MB in the beginning and 81.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 21:35:20,047 INFO L158 Benchmark]: RCFGBuilder took 282.15ms. Allocated memory is still 132.1MB. Free memory was 81.2MB in the beginning and 67.2MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-13 21:35:20,047 INFO L158 Benchmark]: BuchiAutomizer took 5446.80ms. Allocated memory was 132.1MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 67.2MB in the beginning and 491.0MB in the end (delta: -423.7MB). Peak memory consumption was 603.2MB. Max. memory is 16.1GB. [2022-12-13 21:35:20,047 INFO L158 Benchmark]: Witness Printer took 42.07ms. Allocated memory is still 1.2GB. Free memory was 491.0MB in the beginning and 487.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 21:35:20,049 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.19ms. Allocated memory is still 132.1MB. Free memory is still 102.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.72ms. Allocated memory is still 132.1MB. Free memory was 95.5MB in the beginning and 84.5MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.79ms. Allocated memory is still 132.1MB. Free memory was 84.5MB in the beginning and 82.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.60ms. Allocated memory is still 132.1MB. Free memory was 82.7MB in the beginning and 81.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 282.15ms. Allocated memory is still 132.1MB. Free memory was 81.2MB in the beginning and 67.2MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 5446.80ms. Allocated memory was 132.1MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 67.2MB in the beginning and 491.0MB in the end (delta: -423.7MB). Peak memory consumption was 603.2MB. Max. memory is 16.1GB. * Witness Printer took 42.07ms. Allocated memory is still 1.2GB. Free memory was 491.0MB in the beginning and 487.9MB in the end (delta: 3.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 72706 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.3s and 12 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 3.8s. Highest rank in rank-based complementation 0. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 1.9s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 1.0s 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, 589 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 589 mSDsluCounter, 1842 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 709 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55 IncrementalHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 1133 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 - LassoShapedNonTerminationArgument [Line: 50]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. 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; [L48] int cond; Loop: [L50] COND TRUE 1 [L51] cond = __VERIFIER_nondet_int() [L52] COND FALSE !(cond == 0) [L55] lk1 = 0 [L57] lk2 = 0 [L59] lk3 = 0 [L61] lk4 = 0 [L63] lk5 = 0 [L65] lk6 = 0 [L67] lk7 = 0 [L69] lk8 = 0 [L71] lk9 = 0 [L73] lk10 = 0 [L75] lk11 = 0 [L77] lk12 = 0 [L79] lk13 = 0 [L83] COND FALSE !(p1 != 0) [L87] COND FALSE !(p2 != 0) [L91] COND FALSE !(p3 != 0) [L95] COND FALSE !(p4 != 0) [L99] COND FALSE !(p5 != 0) [L103] COND FALSE !(p6 != 0) [L107] COND FALSE !(p7 != 0) [L111] COND FALSE !(p8 != 0) [L115] COND FALSE !(p9 != 0) [L119] COND FALSE !(p10 != 0) [L123] COND FALSE !(p11 != 0) [L127] COND FALSE !(p12 != 0) [L131] COND FALSE !(p13 != 0) [L137] COND FALSE !(p1 != 0) [L142] COND FALSE !(p2 != 0) [L147] COND FALSE !(p3 != 0) [L152] COND FALSE !(p4 != 0) [L157] COND FALSE !(p5 != 0) [L162] COND FALSE !(p6 != 0) [L167] COND FALSE !(p7 != 0) [L172] COND FALSE !(p8 != 0) [L177] COND FALSE !(p9 != 0) [L182] COND FALSE !(p10 != 0) [L187] COND FALSE !(p11 != 0) [L192] COND FALSE !(p12 != 0) [L197] COND FALSE !(p13 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 50]: 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; [L48] int cond; Loop: [L50] COND TRUE 1 [L51] cond = __VERIFIER_nondet_int() [L52] COND FALSE !(cond == 0) [L55] lk1 = 0 [L57] lk2 = 0 [L59] lk3 = 0 [L61] lk4 = 0 [L63] lk5 = 0 [L65] lk6 = 0 [L67] lk7 = 0 [L69] lk8 = 0 [L71] lk9 = 0 [L73] lk10 = 0 [L75] lk11 = 0 [L77] lk12 = 0 [L79] lk13 = 0 [L83] COND FALSE !(p1 != 0) [L87] COND FALSE !(p2 != 0) [L91] COND FALSE !(p3 != 0) [L95] COND FALSE !(p4 != 0) [L99] COND FALSE !(p5 != 0) [L103] COND FALSE !(p6 != 0) [L107] COND FALSE !(p7 != 0) [L111] COND FALSE !(p8 != 0) [L115] COND FALSE !(p9 != 0) [L119] COND FALSE !(p10 != 0) [L123] COND FALSE !(p11 != 0) [L127] COND FALSE !(p12 != 0) [L131] COND FALSE !(p13 != 0) [L137] COND FALSE !(p1 != 0) [L142] COND FALSE !(p2 != 0) [L147] COND FALSE !(p3 != 0) [L152] COND FALSE !(p4 != 0) [L157] COND FALSE !(p5 != 0) [L162] COND FALSE !(p6 != 0) [L167] COND FALSE !(p7 != 0) [L172] COND FALSE !(p8 != 0) [L177] COND FALSE !(p9 != 0) [L182] COND FALSE !(p10 != 0) [L187] COND FALSE !(p11 != 0) [L192] COND FALSE !(p12 != 0) [L197] COND FALSE !(p13 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-12-13 21:35:20,076 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d63a95a-6c11-40f6-a2b4-86a13f230a85/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)