./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_14-2.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_7d2227ed-d1b8-4b95-91dc-74ef193473a5/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d2227ed-d1b8-4b95-91dc-74ef193473a5/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_7d2227ed-d1b8-4b95-91dc-74ef193473a5/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d2227ed-d1b8-4b95-91dc-74ef193473a5/bin/uautomizer-uyxdKDjOR8/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_14-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d2227ed-d1b8-4b95-91dc-74ef193473a5/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_7d2227ed-d1b8-4b95-91dc-74ef193473a5/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 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c --- 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 14:33:07,310 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 14:33:07,312 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 14:33:07,329 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 14:33:07,330 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 14:33:07,331 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 14:33:07,332 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 14:33:07,333 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 14:33:07,335 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 14:33:07,335 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 14:33:07,336 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 14:33:07,337 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 14:33:07,338 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 14:33:07,338 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 14:33:07,339 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 14:33:07,340 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 14:33:07,341 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 14:33:07,342 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 14:33:07,343 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 14:33:07,344 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 14:33:07,346 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 14:33:07,347 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 14:33:07,348 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 14:33:07,348 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 14:33:07,351 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 14:33:07,352 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 14:33:07,352 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 14:33:07,353 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 14:33:07,353 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 14:33:07,354 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 14:33:07,354 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 14:33:07,355 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 14:33:07,356 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 14:33:07,356 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 14:33:07,357 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 14:33:07,357 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 14:33:07,358 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 14:33:07,358 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 14:33:07,358 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 14:33:07,359 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 14:33:07,360 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 14:33:07,360 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d2227ed-d1b8-4b95-91dc-74ef193473a5/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-12-13 14:33:07,381 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 14:33:07,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 14:33:07,381 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 14:33:07,381 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 14:33:07,387 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 14:33:07,387 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 14:33:07,387 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 14:33:07,388 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-12-13 14:33:07,388 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-12-13 14:33:07,388 INFO L138 SettingsManager]: * Use old map elimination=false [2022-12-13 14:33:07,388 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-12-13 14:33:07,388 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-12-13 14:33:07,389 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-12-13 14:33:07,389 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 14:33:07,389 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 14:33:07,389 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 14:33:07,389 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 14:33:07,390 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 14:33:07,390 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 14:33:07,390 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-12-13 14:33:07,390 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-12-13 14:33:07,390 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-12-13 14:33:07,391 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 14:33:07,391 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 14:33:07,391 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-12-13 14:33:07,391 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 14:33:07,391 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-12-13 14:33:07,392 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 14:33:07,392 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 14:33:07,392 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 14:33:07,392 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 14:33:07,393 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-12-13 14:33:07,393 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_7d2227ed-d1b8-4b95-91dc-74ef193473a5/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_7d2227ed-d1b8-4b95-91dc-74ef193473a5/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 -> 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c [2022-12-13 14:33:07,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 14:33:07,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 14:33:07,603 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 14:33:07,604 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 14:33:07,605 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 14:33:07,606 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d2227ed-d1b8-4b95-91dc-74ef193473a5/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/locks/test_locks_14-2.c [2022-12-13 14:33:10,195 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 14:33:10,337 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 14:33:10,337 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d2227ed-d1b8-4b95-91dc-74ef193473a5/sv-benchmarks/c/locks/test_locks_14-2.c [2022-12-13 14:33:10,342 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d2227ed-d1b8-4b95-91dc-74ef193473a5/bin/uautomizer-uyxdKDjOR8/data/88d0e1a5c/cfe5996616734ccba2592554c5931219/FLAGb21b8b7ed [2022-12-13 14:33:10,352 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d2227ed-d1b8-4b95-91dc-74ef193473a5/bin/uautomizer-uyxdKDjOR8/data/88d0e1a5c/cfe5996616734ccba2592554c5931219 [2022-12-13 14:33:10,354 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 14:33:10,355 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 14:33:10,356 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 14:33:10,356 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 14:33:10,358 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 14:33:10,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:33:10" (1/1) ... [2022-12-13 14:33:10,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fc66e6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:33:10, skipping insertion in model container [2022-12-13 14:33:10,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:33:10" (1/1) ... [2022-12-13 14:33:10,365 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 14:33:10,378 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 14:33:10,491 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_7d2227ed-d1b8-4b95-91dc-74ef193473a5/sv-benchmarks/c/locks/test_locks_14-2.c[5305,5318] [2022-12-13 14:33:10,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 14:33:10,501 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 14:33:10,519 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_7d2227ed-d1b8-4b95-91dc-74ef193473a5/sv-benchmarks/c/locks/test_locks_14-2.c[5305,5318] [2022-12-13 14:33:10,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 14:33:10,530 INFO L208 MainTranslator]: Completed translation [2022-12-13 14:33:10,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:33:10 WrapperNode [2022-12-13 14:33:10,530 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 14:33:10,531 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 14:33:10,531 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 14:33:10,531 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 14:33:10,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:33:10" (1/1) ... [2022-12-13 14:33:10,544 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:33:10" (1/1) ... [2022-12-13 14:33:10,564 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 169 [2022-12-13 14:33:10,565 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 14:33:10,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 14:33:10,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 14:33:10,565 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 14:33:10,575 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:33:10" (1/1) ... [2022-12-13 14:33:10,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:33:10" (1/1) ... [2022-12-13 14:33:10,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:33:10" (1/1) ... [2022-12-13 14:33:10,577 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:33:10" (1/1) ... [2022-12-13 14:33:10,581 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:33:10" (1/1) ... [2022-12-13 14:33:10,586 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:33:10" (1/1) ... [2022-12-13 14:33:10,587 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:33:10" (1/1) ... [2022-12-13 14:33:10,588 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:33:10" (1/1) ... [2022-12-13 14:33:10,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 14:33:10,592 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 14:33:10,592 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 14:33:10,592 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 14:33:10,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:33:10" (1/1) ... [2022-12-13 14:33:10,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 14:33:10,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d2227ed-d1b8-4b95-91dc-74ef193473a5/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:33:10,619 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d2227ed-d1b8-4b95-91dc-74ef193473a5/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 14:33:10,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d2227ed-d1b8-4b95-91dc-74ef193473a5/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-12-13 14:33:10,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 14:33:10,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 14:33:10,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 14:33:10,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 14:33:10,711 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 14:33:10,713 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 14:33:10,886 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 14:33:10,892 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 14:33:10,893 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 14:33:10,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:33:10 BoogieIcfgContainer [2022-12-13 14:33:10,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 14:33:10,896 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-12-13 14:33:10,896 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-12-13 14:33:10,900 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-12-13 14:33:10,901 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 14:33:10,901 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.12 02:33:10" (1/3) ... [2022-12-13 14:33:10,902 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@507b8a90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 02:33:10, skipping insertion in model container [2022-12-13 14:33:10,902 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 14:33:10,902 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:33:10" (2/3) ... [2022-12-13 14:33:10,903 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@507b8a90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 02:33:10, skipping insertion in model container [2022-12-13 14:33:10,903 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 14:33:10,903 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:33:10" (3/3) ... [2022-12-13 14:33:10,904 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_14-2.c [2022-12-13 14:33:10,957 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-12-13 14:33:10,957 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-12-13 14:33:10,958 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-12-13 14:33:10,958 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-12-13 14:33:10,958 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-12-13 14:33:10,958 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-12-13 14:33:10,958 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-12-13 14:33:10,958 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-12-13 14:33:10,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 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 14:33:10,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2022-12-13 14:33:10,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 14:33:10,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 14:33:10,988 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 14:33:10,988 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, 1, 1, 1, 1] [2022-12-13 14:33:10,988 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-12-13 14:33:10,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 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 14:33:10,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2022-12-13 14:33:10,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 14:33:10,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 14:33:10,993 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 14:33:10,993 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, 1, 1, 1, 1] [2022-12-13 14:33:11,000 INFO L748 eck$LassoCheckResult]: Stem: 26#$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(18, 2);call #Ultimate.allocInit(12, 3); 35#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 32#L211true [2022-12-13 14:33:11,002 INFO L750 eck$LassoCheckResult]: Loop: 32#L211true assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 45#L55true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 22#L88true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 11#L88-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 33#L92-1true assume !(0 != main_~p3~0#1); 3#L96-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 6#L100-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 48#L104-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 12#L108-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 51#L112-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 27#L116-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 39#L120-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 34#L124-1true assume !(0 != main_~p11~0#1); 16#L128-1true assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 47#L132-1true assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 42#L136-1true assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 38#L140-1true assume !(0 != main_~p1~0#1); 17#L146-1true assume 0 != main_~p2~0#1; 28#L152true assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 13#L151true assume !(0 != main_~p3~0#1); 29#L156-1true assume !(0 != main_~p4~0#1); 4#L161-1true assume !(0 != main_~p5~0#1); 10#L166-1true assume !(0 != main_~p6~0#1); 24#L171-1true assume !(0 != main_~p7~0#1); 20#L176-1true assume !(0 != main_~p8~0#1); 49#L181-1true assume !(0 != main_~p9~0#1); 21#L186-1true assume !(0 != main_~p10~0#1); 37#L191-1true assume !(0 != main_~p11~0#1); 50#L196-1true assume !(0 != main_~p12~0#1); 25#L201-1true assume !(0 != main_~p13~0#1); 14#L206-1true assume 0 != main_~p14~0#1; 8#L212true assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 32#L211true [2022-12-13 14:33:11,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:33:11,008 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-12-13 14:33:11,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:33:11,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317664175] [2022-12-13 14:33:11,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:11,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:33:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:33:11,093 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:33:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:33:11,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:33:11,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:33:11,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1237702727, now seen corresponding path program 1 times [2022-12-13 14:33:11,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:33:11,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303847935] [2022-12-13 14:33:11,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:11,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:33:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:33:11,198 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 14:33:11,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:33:11,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303847935] [2022-12-13 14:33:11,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303847935] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:33:11,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:33:11,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:33:11,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9030443] [2022-12-13 14:33:11,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:33:11,204 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 14:33:11,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:33:11,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:33:11,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:33:11,240 INFO L87 Difference]: Start difference. First operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 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 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 14:33:11,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:33:11,277 INFO L93 Difference]: Finished difference Result 99 states and 178 transitions. [2022-12-13 14:33:11,278 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 178 transitions. [2022-12-13 14:33:11,282 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2022-12-13 14:33:11,286 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 89 states and 139 transitions. [2022-12-13 14:33:11,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2022-12-13 14:33:11,288 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2022-12-13 14:33:11,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 139 transitions. [2022-12-13 14:33:11,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:33:11,289 INFO L218 hiAutomatonCegarLoop]: Abstraction has 89 states and 139 transitions. [2022-12-13 14:33:11,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 139 transitions. [2022-12-13 14:33:11,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-12-13 14:33:11,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.5617977528089888) internal successors, (139), 88 states have internal predecessors, (139), 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 14:33:11,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 139 transitions. [2022-12-13 14:33:11,317 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 139 transitions. [2022-12-13 14:33:11,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:33:11,323 INFO L428 stractBuchiCegarLoop]: Abstraction has 89 states and 139 transitions. [2022-12-13 14:33:11,323 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-12-13 14:33:11,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 139 transitions. [2022-12-13 14:33:11,325 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2022-12-13 14:33:11,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 14:33:11,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 14:33:11,326 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 14:33:11,326 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, 1, 1, 1, 1] [2022-12-13 14:33:11,326 INFO L748 eck$LassoCheckResult]: Stem: 209#$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(18, 2);call #Ultimate.allocInit(12, 3); 175#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 176#L211 [2022-12-13 14:33:11,327 INFO L750 eck$LassoCheckResult]: Loop: 176#L211 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 203#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 204#L88 assume !(0 != main_~p1~0#1); 185#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 163#L92-1 assume !(0 != main_~p3~0#1); 161#L96-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 162#L100-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 170#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 186#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 187#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 210#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 184#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 173#L124-1 assume !(0 != main_~p11~0#1); 174#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 194#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 220#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 218#L140-1 assume !(0 != main_~p1~0#1); 219#L146-1 assume 0 != main_~p2~0#1; 247#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 246#L151 assume !(0 != main_~p3~0#1); 244#L156-1 assume !(0 != main_~p4~0#1); 242#L161-1 assume !(0 != main_~p5~0#1); 240#L166-1 assume !(0 != main_~p6~0#1); 207#L171-1 assume !(0 != main_~p7~0#1); 199#L176-1 assume !(0 != main_~p8~0#1); 201#L181-1 assume !(0 != main_~p9~0#1); 233#L186-1 assume !(0 != main_~p10~0#1); 232#L191-1 assume !(0 != main_~p11~0#1); 215#L196-1 assume !(0 != main_~p12~0#1); 192#L201-1 assume !(0 != main_~p13~0#1); 168#L206-1 assume 0 != main_~p14~0#1; 227#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 176#L211 [2022-12-13 14:33:11,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:33:11,327 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-12-13 14:33:11,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:33:11,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602089861] [2022-12-13 14:33:11,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:11,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:33:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:33:11,337 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:33:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:33:11,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:33:11,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:33:11,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1215070473, now seen corresponding path program 1 times [2022-12-13 14:33:11,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:33:11,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588012457] [2022-12-13 14:33:11,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:11,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:33:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:33:11,410 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 14:33:11,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:33:11,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588012457] [2022-12-13 14:33:11,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588012457] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:33:11,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:33:11,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:33:11,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817350138] [2022-12-13 14:33:11,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:33:11,412 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 14:33:11,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:33:11,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:33:11,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:33:11,413 INFO L87 Difference]: Start difference. First operand 89 states and 139 transitions. cyclomatic complexity: 52 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 14:33:11,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:33:11,436 INFO L93 Difference]: Finished difference Result 174 states and 270 transitions. [2022-12-13 14:33:11,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 270 transitions. [2022-12-13 14:33:11,440 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2022-12-13 14:33:11,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 174 states and 270 transitions. [2022-12-13 14:33:11,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2022-12-13 14:33:11,442 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2022-12-13 14:33:11,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 270 transitions. [2022-12-13 14:33:11,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:33:11,443 INFO L218 hiAutomatonCegarLoop]: Abstraction has 174 states and 270 transitions. [2022-12-13 14:33:11,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 270 transitions. [2022-12-13 14:33:11,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2022-12-13 14:33:11,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 174 states have (on average 1.5517241379310345) internal successors, (270), 173 states have internal predecessors, (270), 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 14:33:11,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 270 transitions. [2022-12-13 14:33:11,456 INFO L240 hiAutomatonCegarLoop]: Abstraction has 174 states and 270 transitions. [2022-12-13 14:33:11,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:33:11,458 INFO L428 stractBuchiCegarLoop]: Abstraction has 174 states and 270 transitions. [2022-12-13 14:33:11,458 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-12-13 14:33:11,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 270 transitions. [2022-12-13 14:33:11,460 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2022-12-13 14:33:11,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 14:33:11,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 14:33:11,461 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 14:33:11,461 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, 1, 1, 1, 1] [2022-12-13 14:33:11,461 INFO L748 eck$LassoCheckResult]: Stem: 486#$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(18, 2);call #Ultimate.allocInit(12, 3); 447#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 448#L211 [2022-12-13 14:33:11,462 INFO L750 eck$LassoCheckResult]: Loop: 448#L211 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 525#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 523#L88 assume !(0 != main_~p1~0#1); 520#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 432#L92-1 assume !(0 != main_~p3~0#1); 433#L96-1 assume !(0 != main_~p4~0#1); 516#L100-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 489#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 459#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 460#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 505#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 506#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 501#L124-1 assume !(0 != main_~p11~0#1); 502#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 499#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 500#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 495#L140-1 assume !(0 != main_~p1~0#1); 496#L146-1 assume 0 != main_~p2~0#1; 573#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 571#L151 assume !(0 != main_~p3~0#1); 567#L156-1 assume !(0 != main_~p4~0#1); 566#L161-1 assume !(0 != main_~p5~0#1); 564#L166-1 assume !(0 != main_~p6~0#1); 559#L171-1 assume !(0 != main_~p7~0#1); 556#L176-1 assume !(0 != main_~p8~0#1); 552#L181-1 assume !(0 != main_~p9~0#1); 545#L186-1 assume !(0 != main_~p10~0#1); 542#L191-1 assume !(0 != main_~p11~0#1); 538#L196-1 assume !(0 != main_~p12~0#1); 534#L201-1 assume !(0 != main_~p13~0#1); 530#L206-1 assume 0 != main_~p14~0#1; 528#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 448#L211 [2022-12-13 14:33:11,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:33:11,462 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-12-13 14:33:11,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:33:11,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061169774] [2022-12-13 14:33:11,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:11,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:33:11,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:33:11,469 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:33:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:33:11,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:33:11,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:33:11,476 INFO L85 PathProgramCache]: Analyzing trace with hash 708157561, now seen corresponding path program 1 times [2022-12-13 14:33:11,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:33:11,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413634891] [2022-12-13 14:33:11,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:11,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:33:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:33:11,523 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 14:33:11,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:33:11,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413634891] [2022-12-13 14:33:11,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413634891] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:33:11,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:33:11,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:33:11,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549566901] [2022-12-13 14:33:11,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:33:11,525 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 14:33:11,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:33:11,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:33:11,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:33:11,526 INFO L87 Difference]: Start difference. First operand 174 states and 270 transitions. cyclomatic complexity: 100 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 14:33:11,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:33:11,545 INFO L93 Difference]: Finished difference Result 342 states and 526 transitions. [2022-12-13 14:33:11,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 342 states and 526 transitions. [2022-12-13 14:33:11,548 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2022-12-13 14:33:11,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 342 states to 342 states and 526 transitions. [2022-12-13 14:33:11,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 342 [2022-12-13 14:33:11,552 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 342 [2022-12-13 14:33:11,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 342 states and 526 transitions. [2022-12-13 14:33:11,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:33:11,554 INFO L218 hiAutomatonCegarLoop]: Abstraction has 342 states and 526 transitions. [2022-12-13 14:33:11,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states and 526 transitions. [2022-12-13 14:33:11,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2022-12-13 14:33:11,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 342 states have (on average 1.5380116959064327) internal successors, (526), 341 states have internal predecessors, (526), 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 14:33:11,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 526 transitions. [2022-12-13 14:33:11,568 INFO L240 hiAutomatonCegarLoop]: Abstraction has 342 states and 526 transitions. [2022-12-13 14:33:11,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:33:11,570 INFO L428 stractBuchiCegarLoop]: Abstraction has 342 states and 526 transitions. [2022-12-13 14:33:11,570 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-12-13 14:33:11,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 342 states and 526 transitions. [2022-12-13 14:33:11,571 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2022-12-13 14:33:11,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 14:33:11,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 14:33:11,572 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 14:33:11,572 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, 1, 1, 1, 1] [2022-12-13 14:33:11,572 INFO L748 eck$LassoCheckResult]: Stem: 1000#$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(18, 2);call #Ultimate.allocInit(12, 3); 966#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 967#L211 [2022-12-13 14:33:11,572 INFO L750 eck$LassoCheckResult]: Loop: 967#L211 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 1029#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 1025#L88 assume !(0 != main_~p1~0#1); 1019#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 1015#L92-1 assume !(0 != main_~p3~0#1); 1016#L96-1 assume !(0 != main_~p4~0#1); 1155#L100-1 assume !(0 != main_~p5~0#1); 1152#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1150#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1148#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1146#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1144#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1142#L124-1 assume !(0 != main_~p11~0#1); 1140#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1138#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 1136#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 1133#L140-1 assume !(0 != main_~p1~0#1); 1130#L146-1 assume 0 != main_~p2~0#1; 1128#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 1121#L151 assume !(0 != main_~p3~0#1); 1116#L156-1 assume !(0 != main_~p4~0#1); 1113#L161-1 assume !(0 != main_~p5~0#1); 1110#L166-1 assume !(0 != main_~p6~0#1); 1105#L171-1 assume !(0 != main_~p7~0#1); 1102#L176-1 assume !(0 != main_~p8~0#1); 1099#L181-1 assume !(0 != main_~p9~0#1); 1095#L186-1 assume !(0 != main_~p10~0#1); 1092#L191-1 assume !(0 != main_~p11~0#1); 1074#L196-1 assume !(0 != main_~p12~0#1); 1050#L201-1 assume !(0 != main_~p13~0#1); 1040#L206-1 assume 0 != main_~p14~0#1; 1036#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 967#L211 [2022-12-13 14:33:11,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:33:11,573 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-12-13 14:33:11,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:33:11,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711517571] [2022-12-13 14:33:11,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:11,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:33:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:33:11,578 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:33:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:33:11,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:33:11,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:33:11,584 INFO L85 PathProgramCache]: Analyzing trace with hash 770197175, now seen corresponding path program 1 times [2022-12-13 14:33:11,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:33:11,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100405841] [2022-12-13 14:33:11,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:11,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:33:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:33:11,616 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 14:33:11,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:33:11,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100405841] [2022-12-13 14:33:11,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100405841] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:33:11,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:33:11,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:33:11,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141815574] [2022-12-13 14:33:11,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:33:11,618 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 14:33:11,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:33:11,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:33:11,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:33:11,619 INFO L87 Difference]: Start difference. First operand 342 states and 526 transitions. cyclomatic complexity: 192 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 14:33:11,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:33:11,635 INFO L93 Difference]: Finished difference Result 674 states and 1026 transitions. [2022-12-13 14:33:11,635 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 674 states and 1026 transitions. [2022-12-13 14:33:11,641 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2022-12-13 14:33:11,644 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 674 states to 674 states and 1026 transitions. [2022-12-13 14:33:11,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 674 [2022-12-13 14:33:11,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 674 [2022-12-13 14:33:11,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 674 states and 1026 transitions. [2022-12-13 14:33:11,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:33:11,647 INFO L218 hiAutomatonCegarLoop]: Abstraction has 674 states and 1026 transitions. [2022-12-13 14:33:11,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states and 1026 transitions. [2022-12-13 14:33:11,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2022-12-13 14:33:11,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 674 states have (on average 1.5222551928783383) internal successors, (1026), 673 states have internal predecessors, (1026), 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 14:33:11,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1026 transitions. [2022-12-13 14:33:11,665 INFO L240 hiAutomatonCegarLoop]: Abstraction has 674 states and 1026 transitions. [2022-12-13 14:33:11,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:33:11,666 INFO L428 stractBuchiCegarLoop]: Abstraction has 674 states and 1026 transitions. [2022-12-13 14:33:11,667 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-12-13 14:33:11,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 674 states and 1026 transitions. [2022-12-13 14:33:11,670 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2022-12-13 14:33:11,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 14:33:11,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 14:33:11,671 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 14:33:11,671 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, 1, 1, 1, 1] [2022-12-13 14:33:11,672 INFO L748 eck$LassoCheckResult]: Stem: 2022#$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(18, 2);call #Ultimate.allocInit(12, 3); 1988#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 1989#L211 [2022-12-13 14:33:11,672 INFO L750 eck$LassoCheckResult]: Loop: 1989#L211 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 2048#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 2049#L88 assume !(0 != main_~p1~0#1); 2242#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 2249#L92-1 assume !(0 != main_~p3~0#1); 2248#L96-1 assume !(0 != main_~p4~0#1); 2245#L100-1 assume !(0 != main_~p5~0#1); 2171#L104-1 assume !(0 != main_~p6~0#1); 2173#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2163#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2164#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 2155#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 2156#L124-1 assume !(0 != main_~p11~0#1); 2147#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 2148#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 2139#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 2140#L140-1 assume !(0 != main_~p1~0#1); 2215#L146-1 assume 0 != main_~p2~0#1; 2212#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 2209#L151 assume !(0 != main_~p3~0#1); 2208#L156-1 assume !(0 != main_~p4~0#1); 2289#L161-1 assume !(0 != main_~p5~0#1); 2288#L166-1 assume !(0 != main_~p6~0#1); 2286#L171-1 assume !(0 != main_~p7~0#1); 2285#L176-1 assume !(0 != main_~p8~0#1); 2275#L181-1 assume !(0 != main_~p9~0#1); 2235#L186-1 assume !(0 != main_~p10~0#1); 2236#L191-1 assume !(0 != main_~p11~0#1); 2177#L196-1 assume !(0 != main_~p12~0#1); 2176#L201-1 assume !(0 != main_~p13~0#1); 2066#L206-1 assume 0 != main_~p14~0#1; 2060#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 1989#L211 [2022-12-13 14:33:11,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:33:11,672 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-12-13 14:33:11,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:33:11,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130266693] [2022-12-13 14:33:11,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:11,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:33:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:33:11,678 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:33:11,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:33:11,683 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:33:11,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:33:11,684 INFO L85 PathProgramCache]: Analyzing trace with hash 910745785, now seen corresponding path program 1 times [2022-12-13 14:33:11,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:33:11,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031051212] [2022-12-13 14:33:11,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:11,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:33:11,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:33:11,713 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 14:33:11,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:33:11,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031051212] [2022-12-13 14:33:11,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031051212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:33:11,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:33:11,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:33:11,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615489601] [2022-12-13 14:33:11,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:33:11,715 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 14:33:11,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:33:11,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:33:11,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:33:11,716 INFO L87 Difference]: Start difference. First operand 674 states and 1026 transitions. cyclomatic complexity: 368 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 14:33:11,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:33:11,733 INFO L93 Difference]: Finished difference Result 1330 states and 2002 transitions. [2022-12-13 14:33:11,733 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1330 states and 2002 transitions. [2022-12-13 14:33:11,744 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2022-12-13 14:33:11,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1330 states to 1330 states and 2002 transitions. [2022-12-13 14:33:11,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1330 [2022-12-13 14:33:11,752 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1330 [2022-12-13 14:33:11,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1330 states and 2002 transitions. [2022-12-13 14:33:11,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:33:11,755 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1330 states and 2002 transitions. [2022-12-13 14:33:11,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states and 2002 transitions. [2022-12-13 14:33:11,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2022-12-13 14:33:11,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1330 states have (on average 1.5052631578947369) internal successors, (2002), 1329 states have internal predecessors, (2002), 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 14:33:11,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 2002 transitions. [2022-12-13 14:33:11,790 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1330 states and 2002 transitions. [2022-12-13 14:33:11,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:33:11,791 INFO L428 stractBuchiCegarLoop]: Abstraction has 1330 states and 2002 transitions. [2022-12-13 14:33:11,791 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-12-13 14:33:11,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1330 states and 2002 transitions. [2022-12-13 14:33:11,799 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2022-12-13 14:33:11,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 14:33:11,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 14:33:11,800 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 14:33:11,800 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, 1, 1, 1, 1] [2022-12-13 14:33:11,800 INFO L748 eck$LassoCheckResult]: Stem: 4035#$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(18, 2);call #Ultimate.allocInit(12, 3); 3999#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 4000#L211 [2022-12-13 14:33:11,800 INFO L750 eck$LassoCheckResult]: Loop: 4000#L211 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 4123#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 4124#L88 assume !(0 != main_~p1~0#1); 4265#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 4262#L92-1 assume !(0 != main_~p3~0#1); 4259#L96-1 assume !(0 != main_~p4~0#1); 4254#L100-1 assume !(0 != main_~p5~0#1); 4248#L104-1 assume !(0 != main_~p6~0#1); 4242#L108-1 assume !(0 != main_~p7~0#1); 4239#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4236#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 4200#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 4201#L124-1 assume !(0 != main_~p11~0#1); 4194#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 4195#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 4187#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 4188#L140-1 assume !(0 != main_~p1~0#1); 4225#L146-1 assume 0 != main_~p2~0#1; 4221#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 4218#L151 assume !(0 != main_~p3~0#1); 4217#L156-1 assume !(0 != main_~p4~0#1); 4285#L161-1 assume !(0 != main_~p5~0#1); 4282#L166-1 assume !(0 != main_~p6~0#1); 4280#L171-1 assume !(0 != main_~p7~0#1); 4279#L176-1 assume !(0 != main_~p8~0#1); 4277#L181-1 assume !(0 != main_~p9~0#1); 4274#L186-1 assume !(0 != main_~p10~0#1); 4273#L191-1 assume !(0 != main_~p11~0#1); 4271#L196-1 assume !(0 != main_~p12~0#1); 4141#L201-1 assume !(0 != main_~p13~0#1); 4140#L206-1 assume 0 != main_~p14~0#1; 4131#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 4000#L211 [2022-12-13 14:33:11,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:33:11,801 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-12-13 14:33:11,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:33:11,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939855656] [2022-12-13 14:33:11,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:11,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:33:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:33:11,806 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:33:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:33:11,811 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:33:11,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:33:11,812 INFO L85 PathProgramCache]: Analyzing trace with hash 776732279, now seen corresponding path program 1 times [2022-12-13 14:33:11,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:33:11,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943700242] [2022-12-13 14:33:11,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:11,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:33:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:33:11,839 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 14:33:11,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:33:11,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943700242] [2022-12-13 14:33:11,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943700242] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:33:11,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:33:11,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:33:11,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046506030] [2022-12-13 14:33:11,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:33:11,840 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 14:33:11,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:33:11,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:33:11,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:33:11,841 INFO L87 Difference]: Start difference. First operand 1330 states and 2002 transitions. cyclomatic complexity: 704 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 14:33:11,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:33:11,861 INFO L93 Difference]: Finished difference Result 2626 states and 3906 transitions. [2022-12-13 14:33:11,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2626 states and 3906 transitions. [2022-12-13 14:33:11,877 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2022-12-13 14:33:11,884 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2626 states to 2626 states and 3906 transitions. [2022-12-13 14:33:11,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2626 [2022-12-13 14:33:11,886 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2626 [2022-12-13 14:33:11,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2626 states and 3906 transitions. [2022-12-13 14:33:11,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:33:11,888 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2626 states and 3906 transitions. [2022-12-13 14:33:11,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2626 states and 3906 transitions. [2022-12-13 14:33:11,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2626 to 2626. [2022-12-13 14:33:11,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2626 states, 2626 states have (on average 1.4874333587204875) internal successors, (3906), 2625 states have internal predecessors, (3906), 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 14:33:11,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 3906 transitions. [2022-12-13 14:33:11,928 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2626 states and 3906 transitions. [2022-12-13 14:33:11,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:33:11,930 INFO L428 stractBuchiCegarLoop]: Abstraction has 2626 states and 3906 transitions. [2022-12-13 14:33:11,930 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-12-13 14:33:11,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2626 states and 3906 transitions. [2022-12-13 14:33:11,939 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2022-12-13 14:33:11,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 14:33:11,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 14:33:11,940 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 14:33:11,940 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, 1, 1, 1, 1] [2022-12-13 14:33:11,940 INFO L748 eck$LassoCheckResult]: Stem: 7995#$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(18, 2);call #Ultimate.allocInit(12, 3); 7960#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 7961#L211 [2022-12-13 14:33:11,940 INFO L750 eck$LassoCheckResult]: Loop: 7961#L211 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 8384#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 8377#L88 assume !(0 != main_~p1~0#1); 8379#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 8499#L92-1 assume !(0 != main_~p3~0#1); 8496#L96-1 assume !(0 != main_~p4~0#1); 8493#L100-1 assume !(0 != main_~p5~0#1); 8490#L104-1 assume !(0 != main_~p6~0#1); 8487#L108-1 assume !(0 != main_~p7~0#1); 8484#L112-1 assume !(0 != main_~p8~0#1); 8482#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 8480#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 8477#L124-1 assume !(0 != main_~p11~0#1); 8475#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 8473#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 8472#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 8470#L140-1 assume !(0 != main_~p1~0#1); 8469#L146-1 assume 0 != main_~p2~0#1; 8468#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 8467#L151 assume !(0 != main_~p3~0#1); 8451#L156-1 assume !(0 != main_~p4~0#1); 8444#L161-1 assume !(0 != main_~p5~0#1); 8445#L166-1 assume !(0 != main_~p6~0#1); 8438#L171-1 assume !(0 != main_~p7~0#1); 8434#L176-1 assume !(0 != main_~p8~0#1); 8430#L181-1 assume !(0 != main_~p9~0#1); 8429#L186-1 assume !(0 != main_~p10~0#1); 8411#L191-1 assume !(0 != main_~p11~0#1); 8404#L196-1 assume !(0 != main_~p12~0#1); 8398#L201-1 assume !(0 != main_~p13~0#1); 8393#L206-1 assume 0 != main_~p14~0#1; 8389#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 7961#L211 [2022-12-13 14:33:11,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:33:11,941 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2022-12-13 14:33:11,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:33:11,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27258976] [2022-12-13 14:33:11,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:11,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:33:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:33:11,946 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:33:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:33:11,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:33:11,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:33:11,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1028706055, now seen corresponding path program 1 times [2022-12-13 14:33:11,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:33:11,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695422417] [2022-12-13 14:33:11,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:11,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:33:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:33:11,975 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 14:33:11,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:33:11,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695422417] [2022-12-13 14:33:11,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695422417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:33:11,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:33:11,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:33:11,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422804814] [2022-12-13 14:33:11,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:33:11,976 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 14:33:11,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:33:11,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:33:11,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:33:11,977 INFO L87 Difference]: Start difference. First operand 2626 states and 3906 transitions. cyclomatic complexity: 1344 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 14:33:11,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:33:11,998 INFO L93 Difference]: Finished difference Result 5186 states and 7618 transitions. [2022-12-13 14:33:11,998 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5186 states and 7618 transitions. [2022-12-13 14:33:12,019 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2022-12-13 14:33:12,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5186 states to 5186 states and 7618 transitions. [2022-12-13 14:33:12,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5186 [2022-12-13 14:33:12,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5186 [2022-12-13 14:33:12,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5186 states and 7618 transitions. [2022-12-13 14:33:12,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:33:12,039 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5186 states and 7618 transitions. [2022-12-13 14:33:12,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5186 states and 7618 transitions. [2022-12-13 14:33:12,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5186 to 5186. [2022-12-13 14:33:12,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5186 states, 5186 states have (on average 1.4689548785190898) internal successors, (7618), 5185 states have internal predecessors, (7618), 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 14:33:12,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5186 states to 5186 states and 7618 transitions. [2022-12-13 14:33:12,110 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5186 states and 7618 transitions. [2022-12-13 14:33:12,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:33:12,111 INFO L428 stractBuchiCegarLoop]: Abstraction has 5186 states and 7618 transitions. [2022-12-13 14:33:12,111 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-12-13 14:33:12,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5186 states and 7618 transitions. [2022-12-13 14:33:12,124 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2022-12-13 14:33:12,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 14:33:12,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 14:33:12,124 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 14:33:12,124 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, 1, 1, 1, 1] [2022-12-13 14:33:12,125 INFO L748 eck$LassoCheckResult]: Stem: 15817#$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(18, 2);call #Ultimate.allocInit(12, 3); 15780#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 15781#L211 [2022-12-13 14:33:12,125 INFO L750 eck$LassoCheckResult]: Loop: 15781#L211 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 16215#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 16211#L88 assume !(0 != main_~p1~0#1); 16209#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 16207#L92-1 assume !(0 != main_~p3~0#1); 16203#L96-1 assume !(0 != main_~p4~0#1); 16199#L100-1 assume !(0 != main_~p5~0#1); 16196#L104-1 assume !(0 != main_~p6~0#1); 16197#L108-1 assume !(0 != main_~p7~0#1); 16279#L112-1 assume !(0 != main_~p8~0#1); 16276#L116-1 assume !(0 != main_~p9~0#1); 16274#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 16272#L124-1 assume !(0 != main_~p11~0#1); 16270#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 16267#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 16265#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 16263#L140-1 assume !(0 != main_~p1~0#1); 16260#L146-1 assume 0 != main_~p2~0#1; 16257#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 16254#L151 assume !(0 != main_~p3~0#1); 16252#L156-1 assume !(0 != main_~p4~0#1); 16250#L161-1 assume !(0 != main_~p5~0#1); 16248#L166-1 assume !(0 != main_~p6~0#1); 16246#L171-1 assume !(0 != main_~p7~0#1); 16242#L176-1 assume !(0 != main_~p8~0#1); 16238#L181-1 assume !(0 != main_~p9~0#1); 16234#L186-1 assume !(0 != main_~p10~0#1); 16231#L191-1 assume !(0 != main_~p11~0#1); 16227#L196-1 assume !(0 != main_~p12~0#1); 16223#L201-1 assume !(0 != main_~p13~0#1); 16220#L206-1 assume 0 != main_~p14~0#1; 16218#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 15781#L211 [2022-12-13 14:33:12,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:33:12,125 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2022-12-13 14:33:12,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:33:12,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723600727] [2022-12-13 14:33:12,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:12,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:33:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:33:12,128 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:33:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:33:12,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:33:12,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:33:12,131 INFO L85 PathProgramCache]: Analyzing trace with hash -809851337, now seen corresponding path program 1 times [2022-12-13 14:33:12,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:33:12,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166985893] [2022-12-13 14:33:12,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:12,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:33:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:33:12,147 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 14:33:12,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:33:12,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166985893] [2022-12-13 14:33:12,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166985893] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:33:12,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:33:12,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:33:12,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826698718] [2022-12-13 14:33:12,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:33:12,149 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 14:33:12,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:33:12,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:33:12,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:33:12,149 INFO L87 Difference]: Start difference. First operand 5186 states and 7618 transitions. cyclomatic complexity: 2560 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 14:33:12,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:33:12,194 INFO L93 Difference]: Finished difference Result 10242 states and 14850 transitions. [2022-12-13 14:33:12,194 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10242 states and 14850 transitions. [2022-12-13 14:33:12,264 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2022-12-13 14:33:12,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10242 states to 10242 states and 14850 transitions. [2022-12-13 14:33:12,305 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10242 [2022-12-13 14:33:12,312 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10242 [2022-12-13 14:33:12,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10242 states and 14850 transitions. [2022-12-13 14:33:12,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:33:12,326 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10242 states and 14850 transitions. [2022-12-13 14:33:12,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10242 states and 14850 transitions. [2022-12-13 14:33:12,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10242 to 10242. [2022-12-13 14:33:12,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10242 states, 10242 states have (on average 1.4499121265377857) internal successors, (14850), 10241 states have internal predecessors, (14850), 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 14:33:12,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10242 states to 10242 states and 14850 transitions. [2022-12-13 14:33:12,484 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10242 states and 14850 transitions. [2022-12-13 14:33:12,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:33:12,485 INFO L428 stractBuchiCegarLoop]: Abstraction has 10242 states and 14850 transitions. [2022-12-13 14:33:12,485 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-12-13 14:33:12,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10242 states and 14850 transitions. [2022-12-13 14:33:12,520 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2022-12-13 14:33:12,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 14:33:12,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 14:33:12,520 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 14:33:12,520 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, 1, 1, 1, 1] [2022-12-13 14:33:12,520 INFO L748 eck$LassoCheckResult]: Stem: 31246#$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(18, 2);call #Ultimate.allocInit(12, 3); 31211#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 31212#L211 [2022-12-13 14:33:12,521 INFO L750 eck$LassoCheckResult]: Loop: 31212#L211 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 31754#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 31750#L88 assume !(0 != main_~p1~0#1); 31748#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 31746#L92-1 assume !(0 != main_~p3~0#1); 31743#L96-1 assume !(0 != main_~p4~0#1); 31744#L100-1 assume !(0 != main_~p5~0#1); 31833#L104-1 assume !(0 != main_~p6~0#1); 31829#L108-1 assume !(0 != main_~p7~0#1); 31825#L112-1 assume !(0 != main_~p8~0#1); 31821#L116-1 assume !(0 != main_~p9~0#1); 31818#L120-1 assume !(0 != main_~p10~0#1); 31816#L124-1 assume !(0 != main_~p11~0#1); 31814#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 31812#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 31809#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 31806#L140-1 assume !(0 != main_~p1~0#1); 31804#L146-1 assume 0 != main_~p2~0#1; 31801#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 31799#L151 assume !(0 != main_~p3~0#1); 31796#L156-1 assume !(0 != main_~p4~0#1); 31793#L161-1 assume !(0 != main_~p5~0#1); 31789#L166-1 assume !(0 != main_~p6~0#1); 31785#L171-1 assume !(0 != main_~p7~0#1); 31781#L176-1 assume !(0 != main_~p8~0#1); 31777#L181-1 assume !(0 != main_~p9~0#1); 31773#L186-1 assume !(0 != main_~p10~0#1); 31770#L191-1 assume !(0 != main_~p11~0#1); 31766#L196-1 assume !(0 != main_~p12~0#1); 31762#L201-1 assume !(0 != main_~p13~0#1); 31759#L206-1 assume 0 != main_~p14~0#1; 31757#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 31212#L211 [2022-12-13 14:33:12,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:33:12,521 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2022-12-13 14:33:12,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:33:12,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650200734] [2022-12-13 14:33:12,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:12,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:33:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:33:12,525 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:33:12,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:33:12,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:33:12,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:33:12,546 INFO L85 PathProgramCache]: Analyzing trace with hash -387149511, now seen corresponding path program 1 times [2022-12-13 14:33:12,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:33:12,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258846030] [2022-12-13 14:33:12,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:12,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:33:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:33:12,564 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 14:33:12,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:33:12,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258846030] [2022-12-13 14:33:12,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258846030] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:33:12,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:33:12,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:33:12,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777301597] [2022-12-13 14:33:12,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:33:12,566 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 14:33:12,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:33:12,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:33:12,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:33:12,567 INFO L87 Difference]: Start difference. First operand 10242 states and 14850 transitions. cyclomatic complexity: 4864 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 14:33:12,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:33:12,635 INFO L93 Difference]: Finished difference Result 20226 states and 28930 transitions. [2022-12-13 14:33:12,635 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20226 states and 28930 transitions. [2022-12-13 14:33:12,761 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2022-12-13 14:33:12,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20226 states to 20226 states and 28930 transitions. [2022-12-13 14:33:12,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20226 [2022-12-13 14:33:12,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20226 [2022-12-13 14:33:12,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20226 states and 28930 transitions. [2022-12-13 14:33:12,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:33:12,844 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20226 states and 28930 transitions. [2022-12-13 14:33:12,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20226 states and 28930 transitions. [2022-12-13 14:33:13,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20226 to 20226. [2022-12-13 14:33:13,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20226 states, 20226 states have (on average 1.43033718975576) internal successors, (28930), 20225 states have internal predecessors, (28930), 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 14:33:13,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20226 states to 20226 states and 28930 transitions. [2022-12-13 14:33:13,123 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20226 states and 28930 transitions. [2022-12-13 14:33:13,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:33:13,124 INFO L428 stractBuchiCegarLoop]: Abstraction has 20226 states and 28930 transitions. [2022-12-13 14:33:13,125 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-12-13 14:33:13,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20226 states and 28930 transitions. [2022-12-13 14:33:13,159 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2022-12-13 14:33:13,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 14:33:13,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 14:33:13,159 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 14:33:13,159 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, 1, 1, 1, 1] [2022-12-13 14:33:13,160 INFO L748 eck$LassoCheckResult]: Stem: 61727#$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(18, 2);call #Ultimate.allocInit(12, 3); 61687#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 61688#L211 [2022-12-13 14:33:13,160 INFO L750 eck$LassoCheckResult]: Loop: 61688#L211 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 62207#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 62208#L88 assume !(0 != main_~p1~0#1); 62353#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 62352#L92-1 assume !(0 != main_~p3~0#1); 62350#L96-1 assume !(0 != main_~p4~0#1); 62348#L100-1 assume !(0 != main_~p5~0#1); 62346#L104-1 assume !(0 != main_~p6~0#1); 62345#L108-1 assume !(0 != main_~p7~0#1); 62343#L112-1 assume !(0 != main_~p8~0#1); 62340#L116-1 assume !(0 != main_~p9~0#1); 62336#L120-1 assume !(0 != main_~p10~0#1); 62333#L124-1 assume !(0 != main_~p11~0#1); 62326#L128-1 assume !(0 != main_~p12~0#1); 62320#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 62316#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 62311#L140-1 assume !(0 != main_~p1~0#1); 62307#L146-1 assume 0 != main_~p2~0#1; 62304#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 62299#L151 assume !(0 != main_~p3~0#1); 62294#L156-1 assume !(0 != main_~p4~0#1); 62080#L161-1 assume !(0 != main_~p5~0#1); 62075#L166-1 assume !(0 != main_~p6~0#1); 62076#L171-1 assume !(0 != main_~p7~0#1); 62279#L176-1 assume !(0 != main_~p8~0#1); 62362#L181-1 assume !(0 != main_~p9~0#1); 62263#L186-1 assume !(0 != main_~p10~0#1); 62264#L191-1 assume !(0 != main_~p11~0#1); 62359#L196-1 assume !(0 != main_~p12~0#1); 62231#L201-1 assume !(0 != main_~p13~0#1); 62223#L206-1 assume 0 != main_~p14~0#1; 62217#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 61688#L211 [2022-12-13 14:33:13,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:33:13,160 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2022-12-13 14:33:13,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:33:13,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548636399] [2022-12-13 14:33:13,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:13,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:33:13,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:33:13,163 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:33:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:33:13,167 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:33:13,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:33:13,168 INFO L85 PathProgramCache]: Analyzing trace with hash -2076093253, now seen corresponding path program 1 times [2022-12-13 14:33:13,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:33:13,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928902787] [2022-12-13 14:33:13,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:13,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:33:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:33:13,187 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 14:33:13,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:33:13,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928902787] [2022-12-13 14:33:13,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928902787] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:33:13,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:33:13,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:33:13,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619161340] [2022-12-13 14:33:13,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:33:13,188 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 14:33:13,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:33:13,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:33:13,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:33:13,189 INFO L87 Difference]: Start difference. First operand 20226 states and 28930 transitions. cyclomatic complexity: 9216 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 14:33:13,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:33:13,303 INFO L93 Difference]: Finished difference Result 39938 states and 56322 transitions. [2022-12-13 14:33:13,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39938 states and 56322 transitions. [2022-12-13 14:33:13,462 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2022-12-13 14:33:13,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39938 states to 39938 states and 56322 transitions. [2022-12-13 14:33:13,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39938 [2022-12-13 14:33:13,602 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39938 [2022-12-13 14:33:13,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39938 states and 56322 transitions. [2022-12-13 14:33:13,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:33:13,631 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39938 states and 56322 transitions. [2022-12-13 14:33:13,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39938 states and 56322 transitions. [2022-12-13 14:33:13,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39938 to 39938. [2022-12-13 14:33:13,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39938 states, 39938 states have (on average 1.4102358655916671) internal successors, (56322), 39937 states have internal predecessors, (56322), 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 14:33:14,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39938 states to 39938 states and 56322 transitions. [2022-12-13 14:33:14,000 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39938 states and 56322 transitions. [2022-12-13 14:33:14,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:33:14,001 INFO L428 stractBuchiCegarLoop]: Abstraction has 39938 states and 56322 transitions. [2022-12-13 14:33:14,001 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-12-13 14:33:14,002 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39938 states and 56322 transitions. [2022-12-13 14:33:14,101 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2022-12-13 14:33:14,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 14:33:14,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 14:33:14,102 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 14:33:14,102 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, 1, 1, 1, 1] [2022-12-13 14:33:14,102 INFO L748 eck$LassoCheckResult]: Stem: 121893#$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(18, 2);call #Ultimate.allocInit(12, 3); 121857#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 121858#L211 [2022-12-13 14:33:14,102 INFO L750 eck$LassoCheckResult]: Loop: 121858#L211 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 122054#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 122050#L88 assume !(0 != main_~p1~0#1); 122046#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 122042#L92-1 assume !(0 != main_~p3~0#1); 122035#L96-1 assume !(0 != main_~p4~0#1); 122027#L100-1 assume !(0 != main_~p5~0#1); 122019#L104-1 assume !(0 != main_~p6~0#1); 122011#L108-1 assume !(0 != main_~p7~0#1); 122003#L112-1 assume !(0 != main_~p8~0#1); 121995#L116-1 assume !(0 != main_~p9~0#1); 121987#L120-1 assume !(0 != main_~p10~0#1); 121982#L124-1 assume !(0 != main_~p11~0#1); 121975#L128-1 assume !(0 != main_~p12~0#1); 121969#L132-1 assume !(0 != main_~p13~0#1); 121963#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 121964#L140-1 assume !(0 != main_~p1~0#1); 122145#L146-1 assume 0 != main_~p2~0#1; 122143#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 122141#L151 assume !(0 != main_~p3~0#1); 122137#L156-1 assume !(0 != main_~p4~0#1); 122130#L161-1 assume !(0 != main_~p5~0#1); 122122#L166-1 assume !(0 != main_~p6~0#1); 122114#L171-1 assume !(0 != main_~p7~0#1); 122106#L176-1 assume !(0 != main_~p8~0#1); 122094#L181-1 assume !(0 != main_~p9~0#1); 122090#L186-1 assume !(0 != main_~p10~0#1); 122081#L191-1 assume !(0 != main_~p11~0#1); 122073#L196-1 assume !(0 != main_~p12~0#1); 122069#L201-1 assume !(0 != main_~p13~0#1); 122065#L206-1 assume 0 != main_~p14~0#1; 122061#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 121858#L211 [2022-12-13 14:33:14,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:33:14,102 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2022-12-13 14:33:14,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:33:14,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332387746] [2022-12-13 14:33:14,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:14,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:33:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:33:14,105 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:33:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:33:14,107 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:33:14,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:33:14,108 INFO L85 PathProgramCache]: Analyzing trace with hash 224729337, now seen corresponding path program 1 times [2022-12-13 14:33:14,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:33:14,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619536794] [2022-12-13 14:33:14,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:14,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:33:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:33:14,112 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:33:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:33:14,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:33:14,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:33:14,119 INFO L85 PathProgramCache]: Analyzing trace with hash -233466693, now seen corresponding path program 1 times [2022-12-13 14:33:14,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:33:14,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065794540] [2022-12-13 14:33:14,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:33:14,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:33:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:33:14,123 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:33:14,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:33:14,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:33:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:33:14,572 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:33:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:33:14,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.12 02:33:14 BoogieIcfgContainer [2022-12-13 14:33:14,607 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-12-13 14:33:14,608 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 14:33:14,608 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 14:33:14,608 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 14:33:14,608 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:33:10" (3/4) ... [2022-12-13 14:33:14,610 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-12-13 14:33:14,639 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d2227ed-d1b8-4b95-91dc-74ef193473a5/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 14:33:14,639 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 14:33:14,640 INFO L158 Benchmark]: Toolchain (without parser) took 4284.82ms. Allocated memory was 136.3MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 101.4MB in the beginning and 868.8MB in the end (delta: -767.5MB). Peak memory consumption was 328.1MB. Max. memory is 16.1GB. [2022-12-13 14:33:14,640 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 136.3MB. Free memory is still 105.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 14:33:14,640 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.68ms. Allocated memory is still 136.3MB. Free memory was 101.4MB in the beginning and 89.8MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 14:33:14,640 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.70ms. Allocated memory is still 136.3MB. Free memory was 89.8MB in the beginning and 88.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 14:33:14,640 INFO L158 Benchmark]: Boogie Preprocessor took 25.76ms. Allocated memory is still 136.3MB. Free memory was 88.1MB in the beginning and 86.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 14:33:14,641 INFO L158 Benchmark]: RCFGBuilder took 303.45ms. Allocated memory is still 136.3MB. Free memory was 86.8MB in the beginning and 72.5MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-13 14:33:14,641 INFO L158 Benchmark]: BuchiAutomizer took 3711.65ms. Allocated memory was 136.3MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 72.1MB in the beginning and 871.9MB in the end (delta: -799.8MB). Peak memory consumption was 296.6MB. Max. memory is 16.1GB. [2022-12-13 14:33:14,641 INFO L158 Benchmark]: Witness Printer took 31.49ms. Allocated memory is still 1.2GB. Free memory was 871.9MB in the beginning and 868.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 14:33:14,642 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 136.3MB. Free memory is still 105.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 174.68ms. Allocated memory is still 136.3MB. Free memory was 101.4MB in the beginning and 89.8MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.70ms. Allocated memory is still 136.3MB. Free memory was 89.8MB in the beginning and 88.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.76ms. Allocated memory is still 136.3MB. Free memory was 88.1MB in the beginning and 86.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 303.45ms. Allocated memory is still 136.3MB. Free memory was 86.8MB in the beginning and 72.5MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 3711.65ms. Allocated memory was 136.3MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 72.1MB in the beginning and 871.9MB in the end (delta: -799.8MB). Peak memory consumption was 296.6MB. Max. memory is 16.1GB. * Witness Printer took 31.49ms. Allocated memory is still 1.2GB. Free memory was 871.9MB in the beginning and 868.8MB 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 10 terminating modules (10 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.10 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 39938 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.6s and 11 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.0s. Büchi inclusion checks took 2.2s. Highest rank in rank-based complementation 0. Minimization of det autom 10. Minimization of nondet autom 0. Automata minimization 1.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.6s 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, 551 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 551 mSDsluCounter, 1762 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 679 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 50 IncrementalHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 1083 mSDtfsCounter, 50 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI10 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: 53]: 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; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L51] int cond; Loop: [L53] COND TRUE 1 [L54] cond = __VERIFIER_nondet_int() [L55] COND FALSE !(cond == 0) [L58] lk1 = 0 [L60] lk2 = 0 [L62] lk3 = 0 [L64] lk4 = 0 [L66] lk5 = 0 [L68] lk6 = 0 [L70] lk7 = 0 [L72] lk8 = 0 [L74] lk9 = 0 [L76] lk10 = 0 [L78] lk11 = 0 [L80] lk12 = 0 [L82] lk13 = 0 [L84] lk14 = 0 [L88] COND FALSE !(p1 != 0) [L92] COND TRUE p2 != 0 [L93] lk2 = 1 [L96] COND FALSE !(p3 != 0) [L100] COND FALSE !(p4 != 0) [L104] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L112] COND FALSE !(p7 != 0) [L116] COND FALSE !(p8 != 0) [L120] COND FALSE !(p9 != 0) [L124] COND FALSE !(p10 != 0) [L128] COND FALSE !(p11 != 0) [L132] COND FALSE !(p12 != 0) [L136] COND FALSE !(p13 != 0) [L140] COND TRUE p14 != 0 [L141] lk14 = 1 [L146] COND FALSE !(p1 != 0) [L151] COND TRUE p2 != 0 [L152] COND FALSE !(lk2 != 1) [L153] lk2 = 0 [L156] COND FALSE !(p3 != 0) [L161] COND FALSE !(p4 != 0) [L166] COND FALSE !(p5 != 0) [L171] COND FALSE !(p6 != 0) [L176] COND FALSE !(p7 != 0) [L181] COND FALSE !(p8 != 0) [L186] COND FALSE !(p9 != 0) [L191] COND FALSE !(p10 != 0) [L196] COND FALSE !(p11 != 0) [L201] COND FALSE !(p12 != 0) [L206] COND FALSE !(p13 != 0) [L211] COND TRUE p14 != 0 [L212] COND FALSE !(lk14 != 1) [L213] lk14 = 0 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 53]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L51] int cond; Loop: [L53] COND TRUE 1 [L54] cond = __VERIFIER_nondet_int() [L55] COND FALSE !(cond == 0) [L58] lk1 = 0 [L60] lk2 = 0 [L62] lk3 = 0 [L64] lk4 = 0 [L66] lk5 = 0 [L68] lk6 = 0 [L70] lk7 = 0 [L72] lk8 = 0 [L74] lk9 = 0 [L76] lk10 = 0 [L78] lk11 = 0 [L80] lk12 = 0 [L82] lk13 = 0 [L84] lk14 = 0 [L88] COND FALSE !(p1 != 0) [L92] COND TRUE p2 != 0 [L93] lk2 = 1 [L96] COND FALSE !(p3 != 0) [L100] COND FALSE !(p4 != 0) [L104] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L112] COND FALSE !(p7 != 0) [L116] COND FALSE !(p8 != 0) [L120] COND FALSE !(p9 != 0) [L124] COND FALSE !(p10 != 0) [L128] COND FALSE !(p11 != 0) [L132] COND FALSE !(p12 != 0) [L136] COND FALSE !(p13 != 0) [L140] COND TRUE p14 != 0 [L141] lk14 = 1 [L146] COND FALSE !(p1 != 0) [L151] COND TRUE p2 != 0 [L152] COND FALSE !(lk2 != 1) [L153] lk2 = 0 [L156] COND FALSE !(p3 != 0) [L161] COND FALSE !(p4 != 0) [L166] COND FALSE !(p5 != 0) [L171] COND FALSE !(p6 != 0) [L176] COND FALSE !(p7 != 0) [L181] COND FALSE !(p8 != 0) [L186] COND FALSE !(p9 != 0) [L191] COND FALSE !(p10 != 0) [L196] COND FALSE !(p11 != 0) [L201] COND FALSE !(p12 != 0) [L206] COND FALSE !(p13 != 0) [L211] COND TRUE p14 != 0 [L212] COND FALSE !(lk14 != 1) [L213] lk14 = 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-12-13 14:33:14,666 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d2227ed-d1b8-4b95-91dc-74ef193473a5/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)