./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_14-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0f8a17c6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50568700-5fe5-4402-b1a4-2a2b168a173d/bin/uautomizer-ZXIjhQolGL/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50568700-5fe5-4402-b1a4-2a2b168a173d/bin/uautomizer-ZXIjhQolGL/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50568700-5fe5-4402-b1a4-2a2b168a173d/bin/uautomizer-ZXIjhQolGL/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50568700-5fe5-4402-b1a4-2a2b168a173d/bin/uautomizer-ZXIjhQolGL/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_14-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50568700-5fe5-4402-b1a4-2a2b168a173d/bin/uautomizer-ZXIjhQolGL/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50568700-5fe5-4402-b1a4-2a2b168a173d/bin/uautomizer-ZXIjhQolGL --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 1e1f6c8a80d54f6d4b7b413368cc99af6eca243b930331d178961d851b56afbd --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-19 05:11:28,345 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-19 05:11:28,347 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-19 05:11:28,396 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-19 05:11:28,397 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-19 05:11:28,402 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-19 05:11:28,404 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-19 05:11:28,408 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-19 05:11:28,411 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-19 05:11:28,417 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-19 05:11:28,418 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-19 05:11:28,420 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-19 05:11:28,421 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-19 05:11:28,425 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-19 05:11:28,428 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-19 05:11:28,436 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-19 05:11:28,438 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-19 05:11:28,439 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-19 05:11:28,445 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-19 05:11:28,452 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-19 05:11:28,455 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-19 05:11:28,456 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-19 05:11:28,460 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-19 05:11:28,461 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-19 05:11:28,473 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-19 05:11:28,473 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-19 05:11:28,473 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-19 05:11:28,476 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-19 05:11:28,476 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-19 05:11:28,478 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-19 05:11:28,479 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-19 05:11:28,480 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-19 05:11:28,482 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-19 05:11:28,483 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-19 05:11:28,485 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-19 05:11:28,485 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-19 05:11:28,486 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-19 05:11:28,486 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-19 05:11:28,487 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-19 05:11:28,487 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-19 05:11:28,488 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-19 05:11:28,490 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50568700-5fe5-4402-b1a4-2a2b168a173d/bin/uautomizer-ZXIjhQolGL/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-11-19 05:11:28,533 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-19 05:11:28,534 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-19 05:11:28,534 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-19 05:11:28,535 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-19 05:11:28,536 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-19 05:11:28,536 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-19 05:11:28,537 INFO L138 SettingsManager]: * Use SBE=true [2021-11-19 05:11:28,537 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-11-19 05:11:28,537 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-11-19 05:11:28,537 INFO L138 SettingsManager]: * Use old map elimination=false [2021-11-19 05:11:28,538 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-11-19 05:11:28,539 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-11-19 05:11:28,539 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-11-19 05:11:28,539 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-19 05:11:28,540 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-19 05:11:28,540 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-19 05:11:28,540 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-19 05:11:28,540 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-19 05:11:28,540 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-19 05:11:28,541 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-11-19 05:11:28,541 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-11-19 05:11:28,541 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-11-19 05:11:28,541 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-19 05:11:28,542 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-19 05:11:28,542 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-11-19 05:11:28,542 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-19 05:11:28,544 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-11-19 05:11:28,544 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-19 05:11:28,544 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-19 05:11:28,545 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-19 05:11:28,545 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-19 05:11:28,545 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-19 05:11:28,546 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-11-19 05:11:28,546 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_50568700-5fe5-4402-b1a4-2a2b168a173d/bin/uautomizer-ZXIjhQolGL/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_50568700-5fe5-4402-b1a4-2a2b168a173d/bin/uautomizer-ZXIjhQolGL 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 -> 1e1f6c8a80d54f6d4b7b413368cc99af6eca243b930331d178961d851b56afbd [2021-11-19 05:11:28,834 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-19 05:11:28,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-19 05:11:28,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-19 05:11:28,864 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-19 05:11:28,865 INFO L275 PluginConnector]: CDTParser initialized [2021-11-19 05:11:28,866 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50568700-5fe5-4402-b1a4-2a2b168a173d/bin/uautomizer-ZXIjhQolGL/../../sv-benchmarks/c/locks/test_locks_14-1.c [2021-11-19 05:11:28,940 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50568700-5fe5-4402-b1a4-2a2b168a173d/bin/uautomizer-ZXIjhQolGL/data/ce18eef05/3731f2d9567e4f9e9b64da6cf05070ae/FLAGb8c087149 [2021-11-19 05:11:29,410 INFO L306 CDTParser]: Found 1 translation units. [2021-11-19 05:11:29,411 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50568700-5fe5-4402-b1a4-2a2b168a173d/sv-benchmarks/c/locks/test_locks_14-1.c [2021-11-19 05:11:29,436 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50568700-5fe5-4402-b1a4-2a2b168a173d/bin/uautomizer-ZXIjhQolGL/data/ce18eef05/3731f2d9567e4f9e9b64da6cf05070ae/FLAGb8c087149 [2021-11-19 05:11:29,757 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50568700-5fe5-4402-b1a4-2a2b168a173d/bin/uautomizer-ZXIjhQolGL/data/ce18eef05/3731f2d9567e4f9e9b64da6cf05070ae [2021-11-19 05:11:29,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-19 05:11:29,761 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-19 05:11:29,762 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-19 05:11:29,763 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-19 05:11:29,766 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-19 05:11:29,767 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:11:29" (1/1) ... [2021-11-19 05:11:29,768 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54118e88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:29, skipping insertion in model container [2021-11-19 05:11:29,768 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:11:29" (1/1) ... [2021-11-19 05:11:29,775 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-19 05:11:29,796 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 05:11:29,984 WARN L230 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_50568700-5fe5-4402-b1a4-2a2b168a173d/sv-benchmarks/c/locks/test_locks_14-1.c[5283,5296] [2021-11-19 05:11:29,985 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 05:11:29,994 INFO L203 MainTranslator]: Completed pre-run [2021-11-19 05:11:30,021 WARN L230 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_50568700-5fe5-4402-b1a4-2a2b168a173d/sv-benchmarks/c/locks/test_locks_14-1.c[5283,5296] [2021-11-19 05:11:30,022 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 05:11:30,035 INFO L208 MainTranslator]: Completed translation [2021-11-19 05:11:30,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:30 WrapperNode [2021-11-19 05:11:30,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-19 05:11:30,037 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-19 05:11:30,037 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-19 05:11:30,037 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-19 05:11:30,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:30" (1/1) ... [2021-11-19 05:11:30,052 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:30" (1/1) ... [2021-11-19 05:11:30,075 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 167 [2021-11-19 05:11:30,076 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-19 05:11:30,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-19 05:11:30,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-19 05:11:30,077 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-19 05:11:30,085 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:30" (1/1) ... [2021-11-19 05:11:30,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:30" (1/1) ... [2021-11-19 05:11:30,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:30" (1/1) ... [2021-11-19 05:11:30,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:30" (1/1) ... [2021-11-19 05:11:30,092 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:30" (1/1) ... [2021-11-19 05:11:30,098 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:30" (1/1) ... [2021-11-19 05:11:30,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:30" (1/1) ... [2021-11-19 05:11:30,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-19 05:11:30,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-19 05:11:30,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-19 05:11:30,104 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-19 05:11:30,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:30" (1/1) ... [2021-11-19 05:11:30,125 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-19 05:11:30,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50568700-5fe5-4402-b1a4-2a2b168a173d/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 05:11:30,169 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50568700-5fe5-4402-b1a4-2a2b168a173d/bin/uautomizer-ZXIjhQolGL/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-19 05:11:30,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50568700-5fe5-4402-b1a4-2a2b168a173d/bin/uautomizer-ZXIjhQolGL/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-11-19 05:11:30,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-19 05:11:30,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-19 05:11:30,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-19 05:11:30,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-19 05:11:30,294 INFO L236 CfgBuilder]: Building ICFG [2021-11-19 05:11:30,295 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-19 05:11:30,481 INFO L277 CfgBuilder]: Performing block encoding [2021-11-19 05:11:30,488 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-19 05:11:30,488 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-19 05:11:30,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:11:30 BoogieIcfgContainer [2021-11-19 05:11:30,491 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-19 05:11:30,492 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-11-19 05:11:30,492 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-11-19 05:11:30,496 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-11-19 05:11:30,496 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-19 05:11:30,497 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 05:11:29" (1/3) ... [2021-11-19 05:11:30,499 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68c6472a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 05:11:30, skipping insertion in model container [2021-11-19 05:11:30,499 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-19 05:11:30,499 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:30" (2/3) ... [2021-11-19 05:11:30,500 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68c6472a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 05:11:30, skipping insertion in model container [2021-11-19 05:11:30,500 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-19 05:11:30,500 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:11:30" (3/3) ... [2021-11-19 05:11:30,501 INFO L388 chiAutomizerObserver]: Analyzing ICFG test_locks_14-1.c [2021-11-19 05:11:30,545 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-11-19 05:11:30,546 INFO L360 BuchiCegarLoop]: Hoare is false [2021-11-19 05:11:30,546 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-11-19 05:11:30,546 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-11-19 05:11:30,546 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-11-19 05:11:30,546 INFO L364 BuchiCegarLoop]: Difference is false [2021-11-19 05:11:30,547 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-11-19 05:11:30,547 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-11-19 05:11:30,564 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) [2021-11-19 05:11:30,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2021-11-19 05:11:30,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-19 05:11:30,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-19 05:11:30,595 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-19 05:11:30,595 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 05:11:30,596 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-11-19 05:11:30,597 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) [2021-11-19 05:11:30,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2021-11-19 05:11:30,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-19 05:11:30,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-19 05:11:30,606 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-19 05:11:30,607 INFO L843 BuchiCegarLoop]: 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] [2021-11-19 05:11:30,614 INFO L791 eck$LassoCheckResult]: Stem: 42#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 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; 37#L211-1true [2021-11-19 05:11:30,622 INFO L793 eck$LassoCheckResult]: Loop: 37#L211-1true assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 46#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; 12#L88-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 33#L92-1true assume !(0 != main_~p3~0#1); 4#L96-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 7#L100-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 49#L104-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 13#L108-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 52#L112-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 26#L116-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 40#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; 43#L136-1true assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 39#L140-1true assume !(0 != main_~p1~0#1); 17#L146-1true assume !(0 != main_~p2~0#1); 31#L151-1true assume !(0 != main_~p3~0#1); 29#L156-1true assume !(0 != main_~p4~0#1); 5#L161-1true assume !(0 != main_~p5~0#1); 11#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); 50#L181-1true assume !(0 != main_~p9~0#1); 21#L186-1true assume !(0 != main_~p10~0#1); 38#L191-1true assume !(0 != main_~p11~0#1); 51#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); 37#L211-1true [2021-11-19 05:11:30,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:11:30,640 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-11-19 05:11:30,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:11:30,656 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897380510] [2021-11-19 05:11:30,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:11:30,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:11:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 05:11:30,765 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-19 05:11:30,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 05:11:30,828 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-19 05:11:30,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:11:30,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1221430905, now seen corresponding path program 1 times [2021-11-19 05:11:30,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:11:30,832 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955080941] [2021-11-19 05:11:30,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:11:30,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:11:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:11:30,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:11:30,982 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:11:30,982 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955080941] [2021-11-19 05:11:30,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955080941] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 05:11:30,984 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 05:11:30,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-19 05:11:30,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368033976] [2021-11-19 05:11:30,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 05:11:30,993 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-19 05:11:30,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:11:31,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-19 05:11:31,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 05:11:31,044 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.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:11:31,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 05:11:31,104 INFO L93 Difference]: Finished difference Result 99 states and 178 transitions. [2021-11-19 05:11:31,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-19 05:11:31,113 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 178 transitions. [2021-11-19 05:11:31,129 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2021-11-19 05:11:31,134 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 89 states and 143 transitions. [2021-11-19 05:11:31,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2021-11-19 05:11:31,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2021-11-19 05:11:31,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 143 transitions. [2021-11-19 05:11:31,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-19 05:11:31,142 INFO L681 BuchiCegarLoop]: Abstraction has 89 states and 143 transitions. [2021-11-19 05:11:31,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 143 transitions. [2021-11-19 05:11:31,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-11-19 05:11:31,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.6067415730337078) internal successors, (143), 88 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:11:31,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 143 transitions. [2021-11-19 05:11:31,190 INFO L704 BuchiCegarLoop]: Abstraction has 89 states and 143 transitions. [2021-11-19 05:11:31,191 INFO L587 BuchiCegarLoop]: Abstraction has 89 states and 143 transitions. [2021-11-19 05:11:31,191 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-11-19 05:11:31,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 143 transitions. [2021-11-19 05:11:31,199 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2021-11-19 05:11:31,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-19 05:11:31,224 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-19 05:11:31,225 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-19 05:11:31,225 INFO L843 BuchiCegarLoop]: 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] [2021-11-19 05:11:31,226 INFO L791 eck$LassoCheckResult]: Stem: 190#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 174#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; 168#L211-1 [2021-11-19 05:11:31,226 INFO L793 eck$LassoCheckResult]: Loop: 168#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 179#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; 202#L88 assume !(0 != main_~p1~0#1); 221#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 220#L92-1 assume !(0 != main_~p3~0#1); 219#L96-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 218#L100-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 208#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 185#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 186#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 205#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 183#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 172#L124-1 assume !(0 != main_~p11~0#1); 173#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 192#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 213#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 211#L140-1 assume !(0 != main_~p1~0#1); 212#L146-1 assume !(0 != main_~p2~0#1); 246#L151-1 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); 237#L171-1 assume !(0 != main_~p7~0#1); 236#L176-1 assume !(0 != main_~p8~0#1); 207#L181-1 assume !(0 != main_~p9~0#1); 194#L186-1 assume !(0 != main_~p10~0#1); 180#L191-1 assume !(0 != main_~p11~0#1); 176#L196-1 assume !(0 != main_~p12~0#1); 189#L201-1 assume !(0 != main_~p13~0#1); 166#L206-1 assume !(0 != main_~p14~0#1); 168#L211-1 [2021-11-19 05:11:31,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:11:31,227 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-11-19 05:11:31,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:11:31,227 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186276526] [2021-11-19 05:11:31,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:11:31,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:11:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 05:11:31,235 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-19 05:11:31,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 05:11:31,263 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-19 05:11:31,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:11:31,266 INFO L85 PathProgramCache]: Analyzing trace with hash 711957815, now seen corresponding path program 1 times [2021-11-19 05:11:31,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:11:31,266 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517869157] [2021-11-19 05:11:31,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:11:31,267 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:11:31,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:11:31,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:11:31,306 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:11:31,306 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517869157] [2021-11-19 05:11:31,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517869157] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 05:11:31,307 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 05:11:31,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-19 05:11:31,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618379346] [2021-11-19 05:11:31,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 05:11:31,308 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-19 05:11:31,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:11:31,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-19 05:11:31,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 05:11:31,310 INFO L87 Difference]: Start difference. First operand 89 states and 143 transitions. cyclomatic complexity: 56 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:11:31,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 05:11:31,331 INFO L93 Difference]: Finished difference Result 174 states and 278 transitions. [2021-11-19 05:11:31,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-19 05:11:31,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 278 transitions. [2021-11-19 05:11:31,336 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2021-11-19 05:11:31,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 174 states and 278 transitions. [2021-11-19 05:11:31,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2021-11-19 05:11:31,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2021-11-19 05:11:31,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 278 transitions. [2021-11-19 05:11:31,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-19 05:11:31,342 INFO L681 BuchiCegarLoop]: Abstraction has 174 states and 278 transitions. [2021-11-19 05:11:31,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 278 transitions. [2021-11-19 05:11:31,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2021-11-19 05:11:31,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 174 states have (on average 1.5977011494252873) internal successors, (278), 173 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:11:31,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 278 transitions. [2021-11-19 05:11:31,358 INFO L704 BuchiCegarLoop]: Abstraction has 174 states and 278 transitions. [2021-11-19 05:11:31,358 INFO L587 BuchiCegarLoop]: Abstraction has 174 states and 278 transitions. [2021-11-19 05:11:31,358 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-11-19 05:11:31,358 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 278 transitions. [2021-11-19 05:11:31,361 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2021-11-19 05:11:31,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-19 05:11:31,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-19 05:11:31,362 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-19 05:11:31,362 INFO L843 BuchiCegarLoop]: 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] [2021-11-19 05:11:31,362 INFO L791 eck$LassoCheckResult]: Stem: 465#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 444#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; 445#L211-1 [2021-11-19 05:11:31,363 INFO L793 eck$LassoCheckResult]: Loop: 445#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 527#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; 525#L88 assume !(0 != main_~p1~0#1); 522#L88-2 assume !(0 != main_~p2~0#1); 517#L92-1 assume !(0 != main_~p3~0#1); 516#L96-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 514#L100-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 512#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 511#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 510#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 509#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 508#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 507#L124-1 assume !(0 != main_~p11~0#1); 506#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 505#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 489#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 490#L140-1 assume !(0 != main_~p1~0#1); 499#L146-1 assume !(0 != main_~p2~0#1); 501#L151-1 assume !(0 != main_~p3~0#1); 550#L156-1 assume !(0 != main_~p4~0#1); 548#L161-1 assume !(0 != main_~p5~0#1); 546#L166-1 assume !(0 != main_~p6~0#1); 543#L171-1 assume !(0 != main_~p7~0#1); 542#L176-1 assume !(0 != main_~p8~0#1); 540#L181-1 assume !(0 != main_~p9~0#1); 537#L186-1 assume !(0 != main_~p10~0#1); 536#L191-1 assume !(0 != main_~p11~0#1); 534#L196-1 assume !(0 != main_~p12~0#1); 532#L201-1 assume !(0 != main_~p13~0#1); 530#L206-1 assume !(0 != main_~p14~0#1); 445#L211-1 [2021-11-19 05:11:31,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:11:31,363 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-11-19 05:11:31,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:11:31,364 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526585056] [2021-11-19 05:11:31,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:11:31,365 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:11:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 05:11:31,370 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-19 05:11:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 05:11:31,378 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-19 05:11:31,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:11:31,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1659781447, now seen corresponding path program 1 times [2021-11-19 05:11:31,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:11:31,380 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564682299] [2021-11-19 05:11:31,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:11:31,380 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:11:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:11:31,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:11:31,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:11:31,416 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564682299] [2021-11-19 05:11:31,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564682299] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 05:11:31,417 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 05:11:31,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-19 05:11:31,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012709216] [2021-11-19 05:11:31,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 05:11:31,418 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-19 05:11:31,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:11:31,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-19 05:11:31,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 05:11:31,419 INFO L87 Difference]: Start difference. First operand 174 states and 278 transitions. cyclomatic complexity: 108 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:11:31,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 05:11:31,449 INFO L93 Difference]: Finished difference Result 342 states and 542 transitions. [2021-11-19 05:11:31,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-19 05:11:31,451 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 342 states and 542 transitions. [2021-11-19 05:11:31,455 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2021-11-19 05:11:31,459 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 342 states to 342 states and 542 transitions. [2021-11-19 05:11:31,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 342 [2021-11-19 05:11:31,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 342 [2021-11-19 05:11:31,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 342 states and 542 transitions. [2021-11-19 05:11:31,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-19 05:11:31,464 INFO L681 BuchiCegarLoop]: Abstraction has 342 states and 542 transitions. [2021-11-19 05:11:31,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states and 542 transitions. [2021-11-19 05:11:31,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2021-11-19 05:11:31,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 342 states have (on average 1.5847953216374269) internal successors, (542), 341 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:11:31,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 542 transitions. [2021-11-19 05:11:31,484 INFO L704 BuchiCegarLoop]: Abstraction has 342 states and 542 transitions. [2021-11-19 05:11:31,484 INFO L587 BuchiCegarLoop]: Abstraction has 342 states and 542 transitions. [2021-11-19 05:11:31,484 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-11-19 05:11:31,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 342 states and 542 transitions. [2021-11-19 05:11:31,487 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2021-11-19 05:11:31,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-19 05:11:31,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-19 05:11:31,489 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-19 05:11:31,489 INFO L843 BuchiCegarLoop]: 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] [2021-11-19 05:11:31,489 INFO L791 eck$LassoCheckResult]: Stem: 983#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 967#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; 968#L211-1 [2021-11-19 05:11:31,490 INFO L793 eck$LassoCheckResult]: Loop: 968#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 1027#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; 1022#L88 assume !(0 != main_~p1~0#1); 1023#L88-2 assume !(0 != main_~p2~0#1); 1152#L92-1 assume !(0 != main_~p3~0#1); 1149#L96-1 assume !(0 != main_~p4~0#1); 1147#L100-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 1145#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1143#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1141#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1139#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1137#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1135#L124-1 assume !(0 != main_~p11~0#1); 1133#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1131#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 1129#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 1125#L140-1 assume !(0 != main_~p1~0#1); 1123#L146-1 assume !(0 != main_~p2~0#1); 1121#L151-1 assume !(0 != main_~p3~0#1); 1116#L156-1 assume !(0 != main_~p4~0#1); 1114#L161-1 assume !(0 != main_~p5~0#1); 1108#L166-1 assume !(0 != main_~p6~0#1); 1103#L171-1 assume !(0 != main_~p7~0#1); 1100#L176-1 assume !(0 != main_~p8~0#1); 1098#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); 1088#L196-1 assume !(0 != main_~p12~0#1); 1068#L201-1 assume !(0 != main_~p13~0#1); 1038#L206-1 assume !(0 != main_~p14~0#1); 968#L211-1 [2021-11-19 05:11:31,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:11:31,490 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-11-19 05:11:31,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:11:31,491 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667140893] [2021-11-19 05:11:31,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:11:31,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:11:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 05:11:31,497 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-19 05:11:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 05:11:31,504 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-19 05:11:31,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:11:31,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1519232837, now seen corresponding path program 1 times [2021-11-19 05:11:31,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:11:31,505 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562448272] [2021-11-19 05:11:31,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:11:31,506 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:11:31,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:11:31,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:11:31,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:11:31,540 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562448272] [2021-11-19 05:11:31,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562448272] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 05:11:31,540 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 05:11:31,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-19 05:11:31,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798788619] [2021-11-19 05:11:31,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 05:11:31,541 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-19 05:11:31,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:11:31,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-19 05:11:31,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 05:11:31,543 INFO L87 Difference]: Start difference. First operand 342 states and 542 transitions. cyclomatic complexity: 208 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:11:31,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 05:11:31,574 INFO L93 Difference]: Finished difference Result 674 states and 1058 transitions. [2021-11-19 05:11:31,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-19 05:11:31,579 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 674 states and 1058 transitions. [2021-11-19 05:11:31,589 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2021-11-19 05:11:31,600 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 674 states to 674 states and 1058 transitions. [2021-11-19 05:11:31,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 674 [2021-11-19 05:11:31,602 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 674 [2021-11-19 05:11:31,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 674 states and 1058 transitions. [2021-11-19 05:11:31,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-19 05:11:31,614 INFO L681 BuchiCegarLoop]: Abstraction has 674 states and 1058 transitions. [2021-11-19 05:11:31,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states and 1058 transitions. [2021-11-19 05:11:31,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2021-11-19 05:11:31,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 674 states have (on average 1.5697329376854599) internal successors, (1058), 673 states have internal predecessors, (1058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:11:31,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1058 transitions. [2021-11-19 05:11:31,644 INFO L704 BuchiCegarLoop]: Abstraction has 674 states and 1058 transitions. [2021-11-19 05:11:31,644 INFO L587 BuchiCegarLoop]: Abstraction has 674 states and 1058 transitions. [2021-11-19 05:11:31,645 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-11-19 05:11:31,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 674 states and 1058 transitions. [2021-11-19 05:11:31,650 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2021-11-19 05:11:31,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-19 05:11:31,650 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-19 05:11:31,651 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-19 05:11:31,651 INFO L843 BuchiCegarLoop]: 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] [2021-11-19 05:11:31,651 INFO L791 eck$LassoCheckResult]: Stem: 2005#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 1986#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; 1987#L211-1 [2021-11-19 05:11:31,651 INFO L793 eck$LassoCheckResult]: Loop: 1987#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 2105#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; 2103#L88 assume !(0 != main_~p1~0#1); 2104#L88-2 assume !(0 != main_~p2~0#1); 2147#L92-1 assume !(0 != main_~p3~0#1); 2145#L96-1 assume !(0 != main_~p4~0#1); 2143#L100-1 assume !(0 != main_~p5~0#1); 2142#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 2141#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2140#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2139#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 2138#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 2137#L124-1 assume !(0 != main_~p11~0#1); 2136#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 2135#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 2134#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 2132#L140-1 assume !(0 != main_~p1~0#1); 2130#L146-1 assume !(0 != main_~p2~0#1); 2129#L151-1 assume !(0 != main_~p3~0#1); 2126#L156-1 assume !(0 != main_~p4~0#1); 2124#L161-1 assume !(0 != main_~p5~0#1); 2123#L166-1 assume !(0 != main_~p6~0#1); 2120#L171-1 assume !(0 != main_~p7~0#1); 2119#L176-1 assume !(0 != main_~p8~0#1); 2117#L181-1 assume !(0 != main_~p9~0#1); 2114#L186-1 assume !(0 != main_~p10~0#1); 2113#L191-1 assume !(0 != main_~p11~0#1); 2111#L196-1 assume !(0 != main_~p12~0#1); 2109#L201-1 assume !(0 != main_~p13~0#1); 2107#L206-1 assume !(0 != main_~p14~0#1); 1987#L211-1 [2021-11-19 05:11:31,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:11:31,652 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-11-19 05:11:31,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:11:31,653 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580319367] [2021-11-19 05:11:31,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:11:31,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:11:31,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 05:11:31,658 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-19 05:11:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 05:11:31,665 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-19 05:11:31,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:11:31,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1653246343, now seen corresponding path program 1 times [2021-11-19 05:11:31,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:11:31,667 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857358118] [2021-11-19 05:11:31,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:11:31,667 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:11:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:11:31,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:11:31,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:11:31,696 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857358118] [2021-11-19 05:11:31,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857358118] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 05:11:31,697 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 05:11:31,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-19 05:11:31,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238031134] [2021-11-19 05:11:31,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 05:11:31,698 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-19 05:11:31,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:11:31,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-19 05:11:31,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 05:11:31,699 INFO L87 Difference]: Start difference. First operand 674 states and 1058 transitions. cyclomatic complexity: 400 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:11:31,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 05:11:31,718 INFO L93 Difference]: Finished difference Result 1330 states and 2066 transitions. [2021-11-19 05:11:31,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-19 05:11:31,720 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1330 states and 2066 transitions. [2021-11-19 05:11:31,740 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2021-11-19 05:11:31,769 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1330 states to 1330 states and 2066 transitions. [2021-11-19 05:11:31,769 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1330 [2021-11-19 05:11:31,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1330 [2021-11-19 05:11:31,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1330 states and 2066 transitions. [2021-11-19 05:11:31,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-19 05:11:31,773 INFO L681 BuchiCegarLoop]: Abstraction has 1330 states and 2066 transitions. [2021-11-19 05:11:31,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states and 2066 transitions. [2021-11-19 05:11:31,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2021-11-19 05:11:31,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1330 states have (on average 1.5533834586466166) internal successors, (2066), 1329 states have internal predecessors, (2066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:11:31,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 2066 transitions. [2021-11-19 05:11:31,840 INFO L704 BuchiCegarLoop]: Abstraction has 1330 states and 2066 transitions. [2021-11-19 05:11:31,840 INFO L587 BuchiCegarLoop]: Abstraction has 1330 states and 2066 transitions. [2021-11-19 05:11:31,840 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-11-19 05:11:31,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1330 states and 2066 transitions. [2021-11-19 05:11:31,850 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2021-11-19 05:11:31,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-19 05:11:31,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-19 05:11:31,853 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-19 05:11:31,853 INFO L843 BuchiCegarLoop]: 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] [2021-11-19 05:11:31,854 INFO L791 eck$LassoCheckResult]: Stem: 4017#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 3996#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; 3997#L211-1 [2021-11-19 05:11:31,854 INFO L793 eck$LassoCheckResult]: Loop: 3997#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 4074#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; 4061#L88 assume !(0 != main_~p1~0#1); 4054#L88-2 assume !(0 != main_~p2~0#1); 4055#L92-1 assume !(0 != main_~p3~0#1); 4048#L96-1 assume !(0 != main_~p4~0#1); 4050#L100-1 assume !(0 != main_~p5~0#1); 4187#L104-1 assume !(0 != main_~p6~0#1); 4189#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 4179#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4180#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 4171#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 4172#L124-1 assume !(0 != main_~p11~0#1); 4163#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 4164#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 4155#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 4156#L140-1 assume !(0 != main_~p1~0#1); 4355#L146-1 assume !(0 != main_~p2~0#1); 4353#L151-1 assume !(0 != main_~p3~0#1); 4348#L156-1 assume !(0 != main_~p4~0#1); 4346#L161-1 assume !(0 != main_~p5~0#1); 4345#L166-1 assume !(0 != main_~p6~0#1); 4342#L171-1 assume !(0 != main_~p7~0#1); 4341#L176-1 assume !(0 != main_~p8~0#1); 4338#L181-1 assume !(0 != main_~p9~0#1); 4335#L186-1 assume !(0 != main_~p10~0#1); 4317#L191-1 assume !(0 != main_~p11~0#1); 4289#L196-1 assume !(0 != main_~p12~0#1); 4288#L201-1 assume !(0 != main_~p13~0#1); 4292#L206-1 assume !(0 != main_~p14~0#1); 3997#L211-1 [2021-11-19 05:11:31,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:11:31,856 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-11-19 05:11:31,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:11:31,857 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909400600] [2021-11-19 05:11:31,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:11:31,858 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:11:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 05:11:31,870 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-19 05:11:31,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 05:11:31,883 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-19 05:11:31,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:11:31,884 INFO L85 PathProgramCache]: Analyzing trace with hash 836282619, now seen corresponding path program 1 times [2021-11-19 05:11:31,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:11:31,885 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871766659] [2021-11-19 05:11:31,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:11:31,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:11:31,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:11:31,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:11:31,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:11:31,946 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871766659] [2021-11-19 05:11:31,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871766659] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 05:11:31,947 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 05:11:31,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-19 05:11:31,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21789760] [2021-11-19 05:11:31,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 05:11:31,948 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-19 05:11:31,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:11:31,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-19 05:11:31,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 05:11:31,951 INFO L87 Difference]: Start difference. First operand 1330 states and 2066 transitions. cyclomatic complexity: 768 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:11:31,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 05:11:31,980 INFO L93 Difference]: Finished difference Result 2626 states and 4034 transitions. [2021-11-19 05:11:31,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-19 05:11:31,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2626 states and 4034 transitions. [2021-11-19 05:11:32,009 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2021-11-19 05:11:32,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2626 states to 2626 states and 4034 transitions. [2021-11-19 05:11:32,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2626 [2021-11-19 05:11:32,034 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2626 [2021-11-19 05:11:32,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2626 states and 4034 transitions. [2021-11-19 05:11:32,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-19 05:11:32,038 INFO L681 BuchiCegarLoop]: Abstraction has 2626 states and 4034 transitions. [2021-11-19 05:11:32,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2626 states and 4034 transitions. [2021-11-19 05:11:32,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2626 to 2626. [2021-11-19 05:11:32,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2626 states, 2626 states have (on average 1.5361766945925361) internal successors, (4034), 2625 states have internal predecessors, (4034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:11:32,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 4034 transitions. [2021-11-19 05:11:32,105 INFO L704 BuchiCegarLoop]: Abstraction has 2626 states and 4034 transitions. [2021-11-19 05:11:32,106 INFO L587 BuchiCegarLoop]: Abstraction has 2626 states and 4034 transitions. [2021-11-19 05:11:32,106 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-11-19 05:11:32,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2626 states and 4034 transitions. [2021-11-19 05:11:32,122 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2021-11-19 05:11:32,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-19 05:11:32,122 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-19 05:11:32,123 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-19 05:11:32,123 INFO L843 BuchiCegarLoop]: 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] [2021-11-19 05:11:32,123 INFO L791 eck$LassoCheckResult]: Stem: 7974#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 7958#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; 7959#L211-1 [2021-11-19 05:11:32,123 INFO L793 eck$LassoCheckResult]: Loop: 7959#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 8097#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; 8093#L88 assume !(0 != main_~p1~0#1); 8086#L88-2 assume !(0 != main_~p2~0#1); 8081#L92-1 assume !(0 != main_~p3~0#1); 8074#L96-1 assume !(0 != main_~p4~0#1); 8066#L100-1 assume !(0 != main_~p5~0#1); 8058#L104-1 assume !(0 != main_~p6~0#1); 8052#L108-1 assume !(0 != main_~p7~0#1); 8047#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 8048#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 8041#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 8042#L124-1 assume !(0 != main_~p11~0#1); 8035#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 8036#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 8028#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 8029#L140-1 assume !(0 != main_~p1~0#1); 8194#L146-1 assume !(0 != main_~p2~0#1); 8174#L151-1 assume !(0 != main_~p3~0#1); 8168#L156-1 assume !(0 != main_~p4~0#1); 8163#L161-1 assume !(0 != main_~p5~0#1); 8159#L166-1 assume !(0 != main_~p6~0#1); 8157#L171-1 assume !(0 != main_~p7~0#1); 8156#L176-1 assume !(0 != main_~p8~0#1); 8154#L181-1 assume !(0 != main_~p9~0#1); 8141#L186-1 assume !(0 != main_~p10~0#1); 8122#L191-1 assume !(0 != main_~p11~0#1); 8118#L196-1 assume !(0 != main_~p12~0#1); 8116#L201-1 assume !(0 != main_~p13~0#1); 8106#L206-1 assume !(0 != main_~p14~0#1); 7959#L211-1 [2021-11-19 05:11:32,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:11:32,124 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-11-19 05:11:32,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:11:32,124 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664753096] [2021-11-19 05:11:32,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:11:32,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:11:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 05:11:32,129 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-19 05:11:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 05:11:32,147 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-19 05:11:32,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:11:32,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1055137337, now seen corresponding path program 1 times [2021-11-19 05:11:32,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:11:32,153 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407578005] [2021-11-19 05:11:32,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:11:32,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:11:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:11:32,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:11:32,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:11:32,184 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407578005] [2021-11-19 05:11:32,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407578005] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 05:11:32,185 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 05:11:32,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-19 05:11:32,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554871002] [2021-11-19 05:11:32,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 05:11:32,186 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-19 05:11:32,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:11:32,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-19 05:11:32,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 05:11:32,186 INFO L87 Difference]: Start difference. First operand 2626 states and 4034 transitions. cyclomatic complexity: 1472 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:11:32,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 05:11:32,251 INFO L93 Difference]: Finished difference Result 5186 states and 7874 transitions. [2021-11-19 05:11:32,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-19 05:11:32,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5186 states and 7874 transitions. [2021-11-19 05:11:32,303 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2021-11-19 05:11:32,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5186 states to 5186 states and 7874 transitions. [2021-11-19 05:11:32,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5186 [2021-11-19 05:11:32,355 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5186 [2021-11-19 05:11:32,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5186 states and 7874 transitions. [2021-11-19 05:11:32,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-19 05:11:32,365 INFO L681 BuchiCegarLoop]: Abstraction has 5186 states and 7874 transitions. [2021-11-19 05:11:32,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5186 states and 7874 transitions. [2021-11-19 05:11:32,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5186 to 5186. [2021-11-19 05:11:32,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5186 states, 5186 states have (on average 1.5183185499421519) internal successors, (7874), 5185 states have internal predecessors, (7874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:11:32,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5186 states to 5186 states and 7874 transitions. [2021-11-19 05:11:32,497 INFO L704 BuchiCegarLoop]: Abstraction has 5186 states and 7874 transitions. [2021-11-19 05:11:32,497 INFO L587 BuchiCegarLoop]: Abstraction has 5186 states and 7874 transitions. [2021-11-19 05:11:32,497 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-11-19 05:11:32,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5186 states and 7874 transitions. [2021-11-19 05:11:32,545 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2021-11-19 05:11:32,545 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-19 05:11:32,545 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-19 05:11:32,548 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-19 05:11:32,548 INFO L843 BuchiCegarLoop]: 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] [2021-11-19 05:11:32,548 INFO L791 eck$LassoCheckResult]: Stem: 15796#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 15777#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; 15778#L211-1 [2021-11-19 05:11:32,549 INFO L793 eck$LassoCheckResult]: Loop: 15778#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 16332#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; 16329#L88 assume !(0 != main_~p1~0#1); 16326#L88-2 assume !(0 != main_~p2~0#1); 16324#L92-1 assume !(0 != main_~p3~0#1); 16321#L96-1 assume !(0 != main_~p4~0#1); 16317#L100-1 assume !(0 != main_~p5~0#1); 16314#L104-1 assume !(0 != main_~p6~0#1); 16311#L108-1 assume !(0 != main_~p7~0#1); 16140#L112-1 assume !(0 != main_~p8~0#1); 16142#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 16090#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 16091#L124-1 assume !(0 != main_~p11~0#1); 16082#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 16083#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 16481#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 16477#L140-1 assume !(0 != main_~p1~0#1); 16066#L146-1 assume !(0 != main_~p2~0#1); 16068#L151-1 assume !(0 != main_~p3~0#1); 16057#L156-1 assume !(0 != main_~p4~0#1); 16059#L161-1 assume !(0 != main_~p5~0#1); 16363#L166-1 assume !(0 != main_~p6~0#1); 16361#L171-1 assume !(0 != main_~p7~0#1); 16359#L176-1 assume !(0 != main_~p8~0#1); 16357#L181-1 assume !(0 != main_~p9~0#1); 16352#L186-1 assume !(0 != main_~p10~0#1); 16349#L191-1 assume !(0 != main_~p11~0#1); 16345#L196-1 assume !(0 != main_~p12~0#1); 16341#L201-1 assume !(0 != main_~p13~0#1); 16337#L206-1 assume !(0 != main_~p14~0#1); 15778#L211-1 [2021-11-19 05:11:32,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:11:32,550 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-11-19 05:11:32,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:11:32,551 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250544584] [2021-11-19 05:11:32,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:11:32,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:11:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 05:11:32,558 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-19 05:11:32,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 05:11:32,562 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-19 05:11:32,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:11:32,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1477839163, now seen corresponding path program 1 times [2021-11-19 05:11:32,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:11:32,563 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077583922] [2021-11-19 05:11:32,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:11:32,564 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:11:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:11:32,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:11:32,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:11:32,612 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077583922] [2021-11-19 05:11:32,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077583922] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 05:11:32,615 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 05:11:32,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-19 05:11:32,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924602529] [2021-11-19 05:11:32,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 05:11:32,615 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-19 05:11:32,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:11:32,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-19 05:11:32,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 05:11:32,620 INFO L87 Difference]: Start difference. First operand 5186 states and 7874 transitions. cyclomatic complexity: 2816 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:11:32,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 05:11:32,688 INFO L93 Difference]: Finished difference Result 10242 states and 15362 transitions. [2021-11-19 05:11:32,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-19 05:11:32,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10242 states and 15362 transitions. [2021-11-19 05:11:32,778 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2021-11-19 05:11:32,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10242 states to 10242 states and 15362 transitions. [2021-11-19 05:11:32,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10242 [2021-11-19 05:11:32,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10242 [2021-11-19 05:11:32,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10242 states and 15362 transitions. [2021-11-19 05:11:32,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-19 05:11:32,878 INFO L681 BuchiCegarLoop]: Abstraction has 10242 states and 15362 transitions. [2021-11-19 05:11:32,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10242 states and 15362 transitions. [2021-11-19 05:11:33,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10242 to 10242. [2021-11-19 05:11:33,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10242 states, 10242 states have (on average 1.4999023628197619) internal successors, (15362), 10241 states have internal predecessors, (15362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:11:33,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10242 states to 10242 states and 15362 transitions. [2021-11-19 05:11:33,220 INFO L704 BuchiCegarLoop]: Abstraction has 10242 states and 15362 transitions. [2021-11-19 05:11:33,220 INFO L587 BuchiCegarLoop]: Abstraction has 10242 states and 15362 transitions. [2021-11-19 05:11:33,220 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-11-19 05:11:33,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10242 states and 15362 transitions. [2021-11-19 05:11:33,276 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2021-11-19 05:11:33,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-19 05:11:33,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-19 05:11:33,278 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-19 05:11:33,278 INFO L843 BuchiCegarLoop]: 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] [2021-11-19 05:11:33,278 INFO L791 eck$LassoCheckResult]: Stem: 31228#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 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-1 [2021-11-19 05:11:33,280 INFO L793 eck$LassoCheckResult]: Loop: 31212#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 31931#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; 31927#L88 assume !(0 != main_~p1~0#1); 31923#L88-2 assume !(0 != main_~p2~0#1); 31921#L92-1 assume !(0 != main_~p3~0#1); 31917#L96-1 assume !(0 != main_~p4~0#1); 31913#L100-1 assume !(0 != main_~p5~0#1); 31910#L104-1 assume !(0 != main_~p6~0#1); 31911#L108-1 assume !(0 != main_~p7~0#1); 31996#L112-1 assume !(0 != main_~p8~0#1); 31993#L116-1 assume !(0 != main_~p9~0#1); 31991#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 31989#L124-1 assume !(0 != main_~p11~0#1); 31987#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 31985#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 31982#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 31978#L140-1 assume !(0 != main_~p1~0#1); 31974#L146-1 assume !(0 != main_~p2~0#1); 31972#L151-1 assume !(0 != main_~p3~0#1); 31968#L156-1 assume !(0 != main_~p4~0#1); 31965#L161-1 assume !(0 != main_~p5~0#1); 31964#L166-1 assume !(0 != main_~p6~0#1); 31962#L171-1 assume !(0 != main_~p7~0#1); 31958#L176-1 assume !(0 != main_~p8~0#1); 31954#L181-1 assume !(0 != main_~p9~0#1); 31950#L186-1 assume !(0 != main_~p10~0#1); 31947#L191-1 assume !(0 != main_~p11~0#1); 31943#L196-1 assume !(0 != main_~p12~0#1); 31939#L201-1 assume !(0 != main_~p13~0#1); 31935#L206-1 assume !(0 != main_~p14~0#1); 31212#L211-1 [2021-11-19 05:11:33,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:11:33,284 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2021-11-19 05:11:33,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:11:33,286 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631628027] [2021-11-19 05:11:33,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:11:33,286 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:11:33,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 05:11:33,290 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-19 05:11:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 05:11:33,298 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-19 05:11:33,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:11:33,299 INFO L85 PathProgramCache]: Analyzing trace with hash 660190713, now seen corresponding path program 1 times [2021-11-19 05:11:33,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:11:33,299 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005884541] [2021-11-19 05:11:33,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:11:33,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:11:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:11:33,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:11:33,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:11:33,342 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005884541] [2021-11-19 05:11:33,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005884541] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 05:11:33,342 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 05:11:33,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-19 05:11:33,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547581894] [2021-11-19 05:11:33,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 05:11:33,344 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-19 05:11:33,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:11:33,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-19 05:11:33,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 05:11:33,346 INFO L87 Difference]: Start difference. First operand 10242 states and 15362 transitions. cyclomatic complexity: 5376 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:11:33,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 05:11:33,527 INFO L93 Difference]: Finished difference Result 20226 states and 29954 transitions. [2021-11-19 05:11:33,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-19 05:11:33,528 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20226 states and 29954 transitions. [2021-11-19 05:11:33,767 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2021-11-19 05:11:33,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20226 states to 20226 states and 29954 transitions. [2021-11-19 05:11:33,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20226 [2021-11-19 05:11:33,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20226 [2021-11-19 05:11:33,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20226 states and 29954 transitions. [2021-11-19 05:11:33,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-19 05:11:33,925 INFO L681 BuchiCegarLoop]: Abstraction has 20226 states and 29954 transitions. [2021-11-19 05:11:33,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20226 states and 29954 transitions. [2021-11-19 05:11:34,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20226 to 20226. [2021-11-19 05:11:34,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20226 states, 20226 states have (on average 1.4809650944329082) internal successors, (29954), 20225 states have internal predecessors, (29954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:11:34,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20226 states to 20226 states and 29954 transitions. [2021-11-19 05:11:34,452 INFO L704 BuchiCegarLoop]: Abstraction has 20226 states and 29954 transitions. [2021-11-19 05:11:34,452 INFO L587 BuchiCegarLoop]: Abstraction has 20226 states and 29954 transitions. [2021-11-19 05:11:34,452 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-11-19 05:11:34,452 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20226 states and 29954 transitions. [2021-11-19 05:11:34,674 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2021-11-19 05:11:34,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-19 05:11:34,674 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-19 05:11:34,675 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-19 05:11:34,675 INFO L843 BuchiCegarLoop]: 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] [2021-11-19 05:11:34,675 INFO L791 eck$LassoCheckResult]: Stem: 61703#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 61684#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; 61685#L211-1 [2021-11-19 05:11:34,676 INFO L793 eck$LassoCheckResult]: Loop: 61685#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 62023#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; 62020#L88 assume !(0 != main_~p1~0#1); 62016#L88-2 assume !(0 != main_~p2~0#1); 62013#L92-1 assume !(0 != main_~p3~0#1); 62010#L96-1 assume !(0 != main_~p4~0#1); 62006#L100-1 assume !(0 != main_~p5~0#1); 62002#L104-1 assume !(0 != main_~p6~0#1); 61995#L108-1 assume !(0 != main_~p7~0#1); 61996#L112-1 assume !(0 != main_~p8~0#1); 62085#L116-1 assume !(0 != main_~p9~0#1); 62081#L120-1 assume !(0 != main_~p10~0#1); 62079#L124-1 assume !(0 != main_~p11~0#1); 62077#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 62075#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 62073#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 62069#L140-1 assume !(0 != main_~p1~0#1); 62065#L146-1 assume !(0 != main_~p2~0#1); 62062#L151-1 assume !(0 != main_~p3~0#1); 62057#L156-1 assume !(0 != main_~p4~0#1); 62053#L161-1 assume !(0 != main_~p5~0#1); 62049#L166-1 assume !(0 != main_~p6~0#1); 62047#L171-1 assume !(0 != main_~p7~0#1); 62045#L176-1 assume !(0 != main_~p8~0#1); 62043#L181-1 assume !(0 != main_~p9~0#1); 62041#L186-1 assume !(0 != main_~p10~0#1); 62040#L191-1 assume !(0 != main_~p11~0#1); 62036#L196-1 assume !(0 != main_~p12~0#1); 62032#L201-1 assume !(0 != main_~p13~0#1); 62028#L206-1 assume !(0 != main_~p14~0#1); 61685#L211-1 [2021-11-19 05:11:34,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:11:34,677 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2021-11-19 05:11:34,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:11:34,678 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666296701] [2021-11-19 05:11:34,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:11:34,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:11:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 05:11:34,682 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-19 05:11:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 05:11:34,699 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-19 05:11:34,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:11:34,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1028753029, now seen corresponding path program 1 times [2021-11-19 05:11:34,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:11:34,701 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130141559] [2021-11-19 05:11:34,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:11:34,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:11:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:11:34,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:11:34,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:11:34,738 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130141559] [2021-11-19 05:11:34,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130141559] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 05:11:34,739 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 05:11:34,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-19 05:11:34,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458080307] [2021-11-19 05:11:34,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 05:11:34,740 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-19 05:11:34,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:11:34,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-19 05:11:34,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 05:11:34,741 INFO L87 Difference]: Start difference. First operand 20226 states and 29954 transitions. cyclomatic complexity: 10240 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:11:34,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 05:11:34,922 INFO L93 Difference]: Finished difference Result 39938 states and 58370 transitions. [2021-11-19 05:11:34,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-19 05:11:34,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39938 states and 58370 transitions. [2021-11-19 05:11:35,320 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2021-11-19 05:11:35,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39938 states to 39938 states and 58370 transitions. [2021-11-19 05:11:35,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39938 [2021-11-19 05:11:35,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39938 [2021-11-19 05:11:35,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39938 states and 58370 transitions. [2021-11-19 05:11:35,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-19 05:11:35,651 INFO L681 BuchiCegarLoop]: Abstraction has 39938 states and 58370 transitions. [2021-11-19 05:11:35,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39938 states and 58370 transitions. [2021-11-19 05:11:36,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39938 to 39938. [2021-11-19 05:11:36,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39938 states, 39938 states have (on average 1.4615153487906254) internal successors, (58370), 39937 states have internal predecessors, (58370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:11:36,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39938 states to 39938 states and 58370 transitions. [2021-11-19 05:11:36,846 INFO L704 BuchiCegarLoop]: Abstraction has 39938 states and 58370 transitions. [2021-11-19 05:11:36,846 INFO L587 BuchiCegarLoop]: Abstraction has 39938 states and 58370 transitions. [2021-11-19 05:11:36,847 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-11-19 05:11:36,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39938 states and 58370 transitions. [2021-11-19 05:11:36,979 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2021-11-19 05:11:36,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-19 05:11:36,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-19 05:11:36,980 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-19 05:11:36,980 INFO L843 BuchiCegarLoop]: 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] [2021-11-19 05:11:36,980 INFO L791 eck$LassoCheckResult]: Stem: 121875#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 121856#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; 121857#L211-1 [2021-11-19 05:11:36,980 INFO L793 eck$LassoCheckResult]: Loop: 121857#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 122012#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; 122010#L88 assume !(0 != main_~p1~0#1); 122006#L88-2 assume !(0 != main_~p2~0#1); 122004#L92-1 assume !(0 != main_~p3~0#1); 122000#L96-1 assume !(0 != main_~p4~0#1); 121996#L100-1 assume !(0 != main_~p5~0#1); 121992#L104-1 assume !(0 != main_~p6~0#1); 121988#L108-1 assume !(0 != main_~p7~0#1); 121984#L112-1 assume !(0 != main_~p8~0#1); 121980#L116-1 assume !(0 != main_~p9~0#1); 121976#L120-1 assume !(0 != main_~p10~0#1); 121974#L124-1 assume !(0 != main_~p11~0#1); 121970#L128-1 assume !(0 != main_~p12~0#1); 121968#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 121966#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 121963#L140-1 assume !(0 != main_~p1~0#1); 121964#L146-1 assume !(0 != main_~p2~0#1); 122060#L151-1 assume !(0 != main_~p3~0#1); 122055#L156-1 assume !(0 != main_~p4~0#1); 122051#L161-1 assume !(0 != main_~p5~0#1); 122047#L166-1 assume !(0 != main_~p6~0#1); 122043#L171-1 assume !(0 != main_~p7~0#1); 122039#L176-1 assume !(0 != main_~p8~0#1); 122035#L181-1 assume !(0 != main_~p9~0#1); 122031#L186-1 assume !(0 != main_~p10~0#1); 122028#L191-1 assume !(0 != main_~p11~0#1); 122023#L196-1 assume !(0 != main_~p12~0#1); 122020#L201-1 assume !(0 != main_~p13~0#1); 122016#L206-1 assume !(0 != main_~p14~0#1); 121857#L211-1 [2021-11-19 05:11:36,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:11:36,981 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2021-11-19 05:11:36,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:11:36,981 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135489699] [2021-11-19 05:11:36,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:11:36,981 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:11:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 05:11:36,985 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-19 05:11:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 05:11:36,989 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-19 05:11:36,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:11:36,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1677866365, now seen corresponding path program 1 times [2021-11-19 05:11:36,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:11:36,990 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983694793] [2021-11-19 05:11:36,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:11:36,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:11:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:11:37,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:11:37,009 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:11:37,010 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983694793] [2021-11-19 05:11:37,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983694793] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 05:11:37,010 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 05:11:37,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-19 05:11:37,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199541121] [2021-11-19 05:11:37,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 05:11:37,011 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-19 05:11:37,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:11:37,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-19 05:11:37,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 05:11:37,012 INFO L87 Difference]: Start difference. First operand 39938 states and 58370 transitions. cyclomatic complexity: 19456 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:11:37,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 05:11:37,350 INFO L93 Difference]: Finished difference Result 78850 states and 113666 transitions. [2021-11-19 05:11:37,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-19 05:11:37,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78850 states and 113666 transitions. [2021-11-19 05:11:37,863 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 78848 [2021-11-19 05:11:38,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78850 states to 78850 states and 113666 transitions. [2021-11-19 05:11:38,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78850 [2021-11-19 05:11:38,211 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78850 [2021-11-19 05:11:38,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78850 states and 113666 transitions. [2021-11-19 05:11:38,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-19 05:11:38,278 INFO L681 BuchiCegarLoop]: Abstraction has 78850 states and 113666 transitions. [2021-11-19 05:11:38,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78850 states and 113666 transitions. [2021-11-19 05:11:39,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78850 to 78850. [2021-11-19 05:11:39,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78850 states, 78850 states have (on average 1.4415472415979709) internal successors, (113666), 78849 states have internal predecessors, (113666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:11:39,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78850 states to 78850 states and 113666 transitions. [2021-11-19 05:11:39,729 INFO L704 BuchiCegarLoop]: Abstraction has 78850 states and 113666 transitions. [2021-11-19 05:11:39,730 INFO L587 BuchiCegarLoop]: Abstraction has 78850 states and 113666 transitions. [2021-11-19 05:11:39,730 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-11-19 05:11:39,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78850 states and 113666 transitions. [2021-11-19 05:11:39,960 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 78848 [2021-11-19 05:11:39,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-19 05:11:39,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-19 05:11:39,962 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-19 05:11:39,962 INFO L843 BuchiCegarLoop]: 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] [2021-11-19 05:11:39,962 INFO L791 eck$LassoCheckResult]: Stem: 240669#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 240648#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; 240649#L211-1 [2021-11-19 05:11:39,962 INFO L793 eck$LassoCheckResult]: Loop: 240649#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 241123#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; 241119#L88 assume !(0 != main_~p1~0#1); 241113#L88-2 assume !(0 != main_~p2~0#1); 241108#L92-1 assume !(0 != main_~p3~0#1); 241104#L96-1 assume !(0 != main_~p4~0#1); 241098#L100-1 assume !(0 != main_~p5~0#1); 241068#L104-1 assume !(0 != main_~p6~0#1); 241070#L108-1 assume !(0 != main_~p7~0#1); 241092#L112-1 assume !(0 != main_~p8~0#1); 241206#L116-1 assume !(0 != main_~p9~0#1); 241203#L120-1 assume !(0 != main_~p10~0#1); 241200#L124-1 assume !(0 != main_~p11~0#1); 241197#L128-1 assume !(0 != main_~p12~0#1); 241193#L132-1 assume !(0 != main_~p13~0#1); 241194#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 241224#L140-1 assume !(0 != main_~p1~0#1); 241222#L146-1 assume !(0 != main_~p2~0#1); 241221#L151-1 assume !(0 != main_~p3~0#1); 241218#L156-1 assume !(0 != main_~p4~0#1); 241216#L161-1 assume !(0 != main_~p5~0#1); 241214#L166-1 assume !(0 != main_~p6~0#1); 241007#L171-1 assume !(0 != main_~p7~0#1); 241002#L176-1 assume !(0 != main_~p8~0#1); 240997#L181-1 assume !(0 != main_~p9~0#1); 240992#L186-1 assume !(0 != main_~p10~0#1); 240993#L191-1 assume !(0 != main_~p11~0#1); 240982#L196-1 assume !(0 != main_~p12~0#1); 240984#L201-1 assume !(0 != main_~p13~0#1); 241131#L206-1 assume !(0 != main_~p14~0#1); 240649#L211-1 [2021-11-19 05:11:39,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:11:39,963 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2021-11-19 05:11:39,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:11:39,963 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857721634] [2021-11-19 05:11:39,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:11:39,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:11:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 05:11:39,968 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-19 05:11:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 05:11:39,972 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-19 05:11:39,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:11:39,973 INFO L85 PathProgramCache]: Analyzing trace with hash 656798011, now seen corresponding path program 1 times [2021-11-19 05:11:39,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:11:39,974 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043267545] [2021-11-19 05:11:39,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:11:39,974 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:11:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:11:39,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-19 05:11:39,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:11:39,991 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043267545] [2021-11-19 05:11:39,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043267545] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 05:11:39,991 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 05:11:39,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-19 05:11:39,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981770338] [2021-11-19 05:11:39,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 05:11:39,992 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-19 05:11:39,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:11:39,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-19 05:11:39,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 05:11:39,993 INFO L87 Difference]: Start difference. First operand 78850 states and 113666 transitions. cyclomatic complexity: 36864 Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:11:40,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 05:11:40,678 INFO L93 Difference]: Finished difference Result 155650 states and 221186 transitions. [2021-11-19 05:11:40,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-19 05:11:40,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155650 states and 221186 transitions. [2021-11-19 05:11:41,585 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 155648 [2021-11-19 05:11:41,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155650 states to 155650 states and 221186 transitions. [2021-11-19 05:11:41,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155650 [2021-11-19 05:11:41,971 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155650 [2021-11-19 05:11:41,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155650 states and 221186 transitions. [2021-11-19 05:11:42,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-19 05:11:42,096 INFO L681 BuchiCegarLoop]: Abstraction has 155650 states and 221186 transitions. [2021-11-19 05:11:42,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155650 states and 221186 transitions. [2021-11-19 05:11:43,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155650 to 155650. [2021-11-19 05:11:43,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155650 states, 155650 states have (on average 1.4210472213299068) internal successors, (221186), 155649 states have internal predecessors, (221186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 05:11:44,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155650 states to 155650 states and 221186 transitions. [2021-11-19 05:11:44,224 INFO L704 BuchiCegarLoop]: Abstraction has 155650 states and 221186 transitions. [2021-11-19 05:11:44,224 INFO L587 BuchiCegarLoop]: Abstraction has 155650 states and 221186 transitions. [2021-11-19 05:11:44,225 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-11-19 05:11:44,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 155650 states and 221186 transitions. [2021-11-19 05:11:45,393 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 155648 [2021-11-19 05:11:45,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-19 05:11:45,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-19 05:11:45,396 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-19 05:11:45,396 INFO L843 BuchiCegarLoop]: 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] [2021-11-19 05:11:45,396 INFO L791 eck$LassoCheckResult]: Stem: 475174#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 475155#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; 475156#L211-1 [2021-11-19 05:11:45,397 INFO L793 eck$LassoCheckResult]: Loop: 475156#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 476630#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; 476626#L88 assume !(0 != main_~p1~0#1); 476622#L88-2 assume !(0 != main_~p2~0#1); 476620#L92-1 assume !(0 != main_~p3~0#1); 476615#L96-1 assume !(0 != main_~p4~0#1); 476603#L100-1 assume !(0 != main_~p5~0#1); 476604#L104-1 assume !(0 != main_~p6~0#1); 476674#L108-1 assume !(0 != main_~p7~0#1); 476661#L112-1 assume !(0 != main_~p8~0#1); 476659#L116-1 assume !(0 != main_~p9~0#1); 476569#L120-1 assume !(0 != main_~p10~0#1); 476571#L124-1 assume !(0 != main_~p11~0#1); 476544#L128-1 assume !(0 != main_~p12~0#1); 476546#L132-1 assume !(0 != main_~p13~0#1); 476521#L136-1 assume !(0 != main_~p14~0#1); 476523#L140-1 assume !(0 != main_~p1~0#1); 476485#L146-1 assume !(0 != main_~p2~0#1); 476487#L151-1 assume !(0 != main_~p3~0#1); 476475#L156-1 assume !(0 != main_~p4~0#1); 476477#L161-1 assume !(0 != main_~p5~0#1); 476335#L166-1 assume !(0 != main_~p6~0#1); 476336#L171-1 assume !(0 != main_~p7~0#1); 476428#L176-1 assume !(0 != main_~p8~0#1); 476650#L181-1 assume !(0 != main_~p9~0#1); 476647#L186-1 assume !(0 != main_~p10~0#1); 476646#L191-1 assume !(0 != main_~p11~0#1); 476643#L196-1 assume !(0 != main_~p12~0#1); 476639#L201-1 assume !(0 != main_~p13~0#1); 476635#L206-1 assume !(0 != main_~p14~0#1); 475156#L211-1 [2021-11-19 05:11:45,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:11:45,398 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 13 times [2021-11-19 05:11:45,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:11:45,398 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437237198] [2021-11-19 05:11:45,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:11:45,399 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:11:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 05:11:45,413 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-19 05:11:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 05:11:45,443 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-19 05:11:45,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:11:45,451 INFO L85 PathProgramCache]: Analyzing trace with hash -623065667, now seen corresponding path program 1 times [2021-11-19 05:11:45,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:11:45,452 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117565284] [2021-11-19 05:11:45,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:11:45,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:11:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 05:11:45,476 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-19 05:11:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 05:11:45,501 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-19 05:11:45,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:11:45,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1839024639, now seen corresponding path program 1 times [2021-11-19 05:11:45,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:11:45,509 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236530686] [2021-11-19 05:11:45,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:11:45,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:11:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 05:11:45,517 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-19 05:11:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 05:11:45,536 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-19 05:11:46,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 05:11:46 BoogieIcfgContainer [2021-11-19 05:11:46,071 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-11-19 05:11:46,072 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-19 05:11:46,072 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-19 05:11:46,072 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-19 05:11:46,073 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:11:30" (3/4) ... [2021-11-19 05:11:46,076 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-11-19 05:11:46,123 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50568700-5fe5-4402-b1a4-2a2b168a173d/bin/uautomizer-ZXIjhQolGL/witness.graphml [2021-11-19 05:11:46,123 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-19 05:11:46,124 INFO L158 Benchmark]: Toolchain (without parser) took 16363.40ms. Allocated memory was 109.1MB in the beginning and 10.4GB in the end (delta: 10.3GB). Free memory was 75.7MB in the beginning and 9.1GB in the end (delta: -9.0GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2021-11-19 05:11:46,125 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory was 62.0MB in the beginning and 62.0MB in the end (delta: 46.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 05:11:46,125 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.76ms. Allocated memory is still 109.1MB. Free memory was 75.4MB in the beginning and 83.6MB in the end (delta: -8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-19 05:11:46,126 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.86ms. Allocated memory is still 109.1MB. Free memory was 83.6MB in the beginning and 81.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-19 05:11:46,126 INFO L158 Benchmark]: Boogie Preprocessor took 26.24ms. Allocated memory is still 109.1MB. Free memory was 81.5MB in the beginning and 80.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 05:11:46,126 INFO L158 Benchmark]: RCFGBuilder took 387.53ms. Allocated memory is still 109.1MB. Free memory was 80.1MB in the beginning and 67.4MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-19 05:11:46,127 INFO L158 Benchmark]: BuchiAutomizer took 15579.33ms. Allocated memory was 109.1MB in the beginning and 10.4GB in the end (delta: 10.3GB). Free memory was 67.4MB in the beginning and 9.1GB in the end (delta: -9.1GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2021-11-19 05:11:46,127 INFO L158 Benchmark]: Witness Printer took 51.91ms. Allocated memory is still 10.4GB. Free memory was 9.1GB in the beginning and 9.1GB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-19 05:11:46,130 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory was 62.0MB in the beginning and 62.0MB in the end (delta: 46.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.76ms. Allocated memory is still 109.1MB. Free memory was 75.4MB in the beginning and 83.6MB in the end (delta: -8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.86ms. Allocated memory is still 109.1MB. Free memory was 83.6MB in the beginning and 81.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.24ms. Allocated memory is still 109.1MB. Free memory was 81.5MB in the beginning and 80.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 387.53ms. Allocated memory is still 109.1MB. Free memory was 80.1MB in the beginning and 67.4MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 15579.33ms. Allocated memory was 109.1MB in the beginning and 10.4GB in the end (delta: 10.3GB). Free memory was 67.4MB in the beginning and 9.1GB in the end (delta: -9.1GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 51.91ms. Allocated memory is still 10.4GB. Free memory was 9.1GB in the beginning and 9.1GB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (12 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.12 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 155650 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.5s and 13 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. Construction of modules took 0.1s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 0. Minimization of det autom 12. Minimization of nondet autom 0. Automata minimization 6.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 3.4s Buchi closure took 0.1s. Biggest automaton had 155650 states and ocurred in iteration 12. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 690 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 690 mSDsluCounter, 2157 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 833 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 60 IncrementalHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 1324 mSDtfsCounter, 60 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI12 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 53]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {p11=0, p13=0, lk5=0, p1=0, NULL=0, lk13=0, p9=0, lk9=0, NULL=1, lk12=0, cond=4, p5=0, p12=0, p10=0, lk2=0, p4=0, p14=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@64028f0d=0, lk6=0, lk11=0, lk1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4604c47b=0, p3=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1f92ac52=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6ef85ebc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1d60fe90=0, p7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1f2d98d8=0, \result=0, lk10=0, lk7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@326ae247=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@42e079e0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@445a8ea=0, p6=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1e4b528c=0, lk14=0, p2=0, lk4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3c82efff=4, lk8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4acddc1e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@b2383de=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6b4b9bae=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2fd07b79=0} - 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 FALSE !(p2 != 0) [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 FALSE !(p14 != 0) [L146] COND FALSE !(p1 != 0) [L151] COND FALSE !(p2 != 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 FALSE !(p14 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-11-19 05:11:46,196 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50568700-5fe5-4402-b1a4-2a2b168a173d/bin/uautomizer-ZXIjhQolGL/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)