./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b558703-2725-4753-835f-c672acd93b2d/bin/uautomizer-tBqnrhUYjU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b558703-2725-4753-835f-c672acd93b2d/bin/uautomizer-tBqnrhUYjU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b558703-2725-4753-835f-c672acd93b2d/bin/uautomizer-tBqnrhUYjU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b558703-2725-4753-835f-c672acd93b2d/bin/uautomizer-tBqnrhUYjU/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_13.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b558703-2725-4753-835f-c672acd93b2d/bin/uautomizer-tBqnrhUYjU/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b558703-2725-4753-835f-c672acd93b2d/bin/uautomizer-tBqnrhUYjU --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-02 22:52:12,431 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 22:52:12,436 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 22:52:12,522 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 22:52:12,523 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 22:52:12,530 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 22:52:12,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 22:52:12,538 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 22:52:12,543 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 22:52:12,553 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 22:52:12,556 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 22:52:12,558 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 22:52:12,559 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 22:52:12,563 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 22:52:12,566 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 22:52:12,574 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 22:52:12,578 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 22:52:12,579 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 22:52:12,586 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 22:52:12,592 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 22:52:12,600 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 22:52:12,602 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 22:52:12,605 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 22:52:12,608 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 22:52:12,618 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 22:52:12,619 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 22:52:12,619 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 22:52:12,623 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 22:52:12,624 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 22:52:12,626 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 22:52:12,627 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 22:52:12,628 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 22:52:12,630 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 22:52:12,632 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 22:52:12,635 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 22:52:12,635 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 22:52:12,637 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 22:52:12,637 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 22:52:12,637 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 22:52:12,639 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 22:52:12,640 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 22:52:12,641 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b558703-2725-4753-835f-c672acd93b2d/bin/uautomizer-tBqnrhUYjU/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-11-02 22:52:12,708 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 22:52:12,711 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 22:52:12,712 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 22:52:12,713 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 22:52:12,715 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 22:52:12,715 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 22:52:12,716 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 22:52:12,716 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-11-02 22:52:12,716 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-11-02 22:52:12,717 INFO L138 SettingsManager]: * Use old map elimination=false [2021-11-02 22:52:12,718 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-11-02 22:52:12,718 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-11-02 22:52:12,719 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-11-02 22:52:12,719 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 22:52:12,719 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-02 22:52:12,720 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-02 22:52:12,720 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-02 22:52:12,720 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-02 22:52:12,721 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 22:52:12,721 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-11-02 22:52:12,721 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-11-02 22:52:12,722 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-11-02 22:52:12,722 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-02 22:52:12,722 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 22:52:12,723 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-11-02 22:52:12,723 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 22:52:12,725 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-11-02 22:52:12,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 22:52:12,726 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 22:52:12,726 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 22:52:12,726 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-02 22:52:12,727 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 22:52:12,729 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-11-02 22:52:12,729 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_5b558703-2725-4753-835f-c672acd93b2d/bin/uautomizer-tBqnrhUYjU/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_5b558703-2725-4753-835f-c672acd93b2d/bin/uautomizer-tBqnrhUYjU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd [2021-11-02 22:52:13,142 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 22:52:13,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 22:52:13,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 22:52:13,175 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 22:52:13,177 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 22:52:13,178 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b558703-2725-4753-835f-c672acd93b2d/bin/uautomizer-tBqnrhUYjU/../../sv-benchmarks/c/locks/test_locks_13.c [2021-11-02 22:52:13,286 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b558703-2725-4753-835f-c672acd93b2d/bin/uautomizer-tBqnrhUYjU/data/9d259a94d/954f26960dfe4cc6abd06bc6ab054d23/FLAG679aab49a [2021-11-02 22:52:13,966 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 22:52:13,972 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b558703-2725-4753-835f-c672acd93b2d/sv-benchmarks/c/locks/test_locks_13.c [2021-11-02 22:52:13,992 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b558703-2725-4753-835f-c672acd93b2d/bin/uautomizer-tBqnrhUYjU/data/9d259a94d/954f26960dfe4cc6abd06bc6ab054d23/FLAG679aab49a [2021-11-02 22:52:14,290 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b558703-2725-4753-835f-c672acd93b2d/bin/uautomizer-tBqnrhUYjU/data/9d259a94d/954f26960dfe4cc6abd06bc6ab054d23 [2021-11-02 22:52:14,292 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 22:52:14,295 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 22:52:14,297 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 22:52:14,297 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 22:52:14,301 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 22:52:14,302 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 10:52:14" (1/1) ... [2021-11-02 22:52:14,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aba1c4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:52:14, skipping insertion in model container [2021-11-02 22:52:14,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 10:52:14" (1/1) ... [2021-11-02 22:52:14,313 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 22:52:14,338 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 22:52:14,601 WARN L228 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_5b558703-2725-4753-835f-c672acd93b2d/sv-benchmarks/c/locks/test_locks_13.c[4936,4949] [2021-11-02 22:52:14,604 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 22:52:14,630 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 22:52:14,693 WARN L228 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_5b558703-2725-4753-835f-c672acd93b2d/sv-benchmarks/c/locks/test_locks_13.c[4936,4949] [2021-11-02 22:52:14,699 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 22:52:14,724 INFO L208 MainTranslator]: Completed translation [2021-11-02 22:52:14,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:52:14 WrapperNode [2021-11-02 22:52:14,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 22:52:14,727 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 22:52:14,727 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 22:52:14,728 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 22:52:14,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:52:14" (1/1) ... [2021-11-02 22:52:14,761 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:52:14" (1/1) ... [2021-11-02 22:52:14,803 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 22:52:14,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 22:52:14,804 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 22:52:14,804 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 22:52:14,815 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:52:14" (1/1) ... [2021-11-02 22:52:14,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:52:14" (1/1) ... [2021-11-02 22:52:14,832 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:52:14" (1/1) ... [2021-11-02 22:52:14,832 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:52:14" (1/1) ... [2021-11-02 22:52:14,838 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:52:14" (1/1) ... [2021-11-02 22:52:14,857 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:52:14" (1/1) ... [2021-11-02 22:52:14,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:52:14" (1/1) ... [2021-11-02 22:52:14,865 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 22:52:14,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 22:52:14,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 22:52:14,880 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 22:52:14,882 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:52:14" (1/1) ... [2021-11-02 22:52:14,891 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-02 22:52:14,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b558703-2725-4753-835f-c672acd93b2d/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:52:14,925 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b558703-2725-4753-835f-c672acd93b2d/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-02 22:52:14,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b558703-2725-4753-835f-c672acd93b2d/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-11-02 22:52:14,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 22:52:14,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 22:52:14,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-02 22:52:14,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 22:52:15,340 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 22:52:15,340 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-11-02 22:52:15,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:52:15 BoogieIcfgContainer [2021-11-02 22:52:15,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 22:52:15,344 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-11-02 22:52:15,344 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-11-02 22:52:15,348 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-11-02 22:52:15,349 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-02 22:52:15,350 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.11 10:52:14" (1/3) ... [2021-11-02 22:52:15,366 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d88182a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.11 10:52:15, skipping insertion in model container [2021-11-02 22:52:15,366 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-02 22:52:15,366 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:52:14" (2/3) ... [2021-11-02 22:52:15,367 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d88182a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.11 10:52:15, skipping insertion in model container [2021-11-02 22:52:15,367 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-02 22:52:15,367 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:52:15" (3/3) ... [2021-11-02 22:52:15,369 INFO L389 chiAutomizerObserver]: Analyzing ICFG test_locks_13.c [2021-11-02 22:52:15,423 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-11-02 22:52:15,423 INFO L360 BuchiCegarLoop]: Hoare is false [2021-11-02 22:52:15,423 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-11-02 22:52:15,423 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-11-02 22:52:15,424 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-11-02 22:52:15,424 INFO L364 BuchiCegarLoop]: Difference is false [2021-11-02 22:52:15,424 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-11-02 22:52:15,424 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-11-02 22:52:15,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:52:15,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2021-11-02 22:52:15,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:52:15,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:52:15,494 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-02 22:52:15,495 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] [2021-11-02 22:52:15,495 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-11-02 22:52:15,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:52:15,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2021-11-02 22:52:15,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:52:15,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:52:15,513 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-02 22:52:15,514 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] [2021-11-02 22:52:15,523 INFO L791 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 7#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 14#L197-1true [2021-11-02 22:52:15,534 INFO L793 eck$LassoCheckResult]: Loop: 14#L197-1true assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 44#L52true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 29#L83true assume 0 != main_~p1~0;main_~lk1~0 := 1; 16#L83-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 10#L87-1true assume !(0 != main_~p3~0); 4#L91-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 46#L95-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 17#L99-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 11#L103-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 26#L107-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 15#L111-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 33#L115-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 35#L119-1true assume !(0 != main_~p11~0); 47#L123-1true assume 0 != main_~p12~0;main_~lk12~0 := 1; 27#L127-1true assume 0 != main_~p13~0;main_~lk13~0 := 1; 36#L131-1true assume !(0 != main_~p1~0); 13#L137-1true assume !(0 != main_~p2~0); 8#L142-1true assume !(0 != main_~p3~0); 37#L147-1true assume !(0 != main_~p4~0); 12#L152-1true assume !(0 != main_~p5~0); 21#L157-1true assume !(0 != main_~p6~0); 18#L162-1true assume !(0 != main_~p7~0); 19#L167-1true assume !(0 != main_~p8~0); 24#L172-1true assume !(0 != main_~p9~0); 32#L177-1true assume !(0 != main_~p10~0); 48#L182-1true assume !(0 != main_~p11~0); 45#L187-1true assume !(0 != main_~p12~0); 39#L192-1true assume !(0 != main_~p13~0); 14#L197-1true [2021-11-02 22:52:15,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:52:15,548 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-11-02 22:52:15,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:52:15,560 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867336374] [2021-11-02 22:52:15,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:52:15,564 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:52:15,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:52:15,739 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:52:15,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:52:15,839 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:52:15,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:52:15,859 INFO L85 PathProgramCache]: Analyzing trace with hash 203947253, now seen corresponding path program 1 times [2021-11-02 22:52:15,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:52:15,862 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798545672] [2021-11-02 22:52:15,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:52:15,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:52:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:52:16,048 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-02 22:52:16,048 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:52:16,049 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798545672] [2021-11-02 22:52:16,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798545672] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:52:16,059 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:52:16,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 22:52:16,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089064013] [2021-11-02 22:52:16,067 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-02 22:52:16,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:52:16,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 22:52:16,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 22:52:16,106 INFO L87 Difference]: Start difference. First operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:52:16,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:52:16,171 INFO L93 Difference]: Finished difference Result 93 states and 166 transitions. [2021-11-02 22:52:16,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 22:52:16,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 166 transitions. [2021-11-02 22:52:16,180 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2021-11-02 22:52:16,187 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 83 states and 133 transitions. [2021-11-02 22:52:16,189 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2021-11-02 22:52:16,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 [2021-11-02 22:52:16,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 133 transitions. [2021-11-02 22:52:16,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:52:16,193 INFO L681 BuchiCegarLoop]: Abstraction has 83 states and 133 transitions. [2021-11-02 22:52:16,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 133 transitions. [2021-11-02 22:52:16,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2021-11-02 22:52:16,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.6024096385542168) internal successors, (133), 82 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:52:16,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 133 transitions. [2021-11-02 22:52:16,242 INFO L704 BuchiCegarLoop]: Abstraction has 83 states and 133 transitions. [2021-11-02 22:52:16,242 INFO L587 BuchiCegarLoop]: Abstraction has 83 states and 133 transitions. [2021-11-02 22:52:16,242 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-11-02 22:52:16,242 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 133 transitions. [2021-11-02 22:52:16,250 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2021-11-02 22:52:16,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:52:16,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:52:16,251 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-02 22:52:16,251 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] [2021-11-02 22:52:16,252 INFO L791 eck$LassoCheckResult]: Stem: 181#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 156#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 157#L197-1 [2021-11-02 22:52:16,252 INFO L793 eck$LassoCheckResult]: Loop: 157#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 209#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 208#L83 assume !(0 != main_~p1~0); 207#L83-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 206#L87-1 assume !(0 != main_~p3~0); 205#L91-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 198#L95-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 174#L99-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 164#L103-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 165#L107-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 202#L111-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 192#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 193#L119-1 assume !(0 != main_~p11~0); 201#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 185#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 186#L131-1 assume !(0 != main_~p1~0); 200#L137-1 assume !(0 != main_~p2~0); 231#L142-1 assume !(0 != main_~p3~0); 229#L147-1 assume !(0 != main_~p4~0); 227#L152-1 assume !(0 != main_~p5~0); 225#L157-1 assume !(0 != main_~p6~0); 223#L162-1 assume !(0 != main_~p7~0); 221#L167-1 assume !(0 != main_~p8~0); 218#L172-1 assume !(0 != main_~p9~0); 217#L177-1 assume !(0 != main_~p10~0); 215#L182-1 assume !(0 != main_~p11~0); 212#L187-1 assume !(0 != main_~p12~0); 211#L192-1 assume !(0 != main_~p13~0); 157#L197-1 [2021-11-02 22:52:16,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:52:16,253 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-11-02 22:52:16,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:52:16,254 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709307439] [2021-11-02 22:52:16,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:52:16,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:52:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:52:16,305 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:52:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:52:16,339 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:52:16,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:52:16,340 INFO L85 PathProgramCache]: Analyzing trace with hash 265986867, now seen corresponding path program 1 times [2021-11-02 22:52:16,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:52:16,341 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944183371] [2021-11-02 22:52:16,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:52:16,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:52:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:52:16,437 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-02 22:52:16,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:52:16,440 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944183371] [2021-11-02 22:52:16,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944183371] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:52:16,443 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:52:16,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 22:52:16,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823220251] [2021-11-02 22:52:16,444 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-02 22:52:16,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:52:16,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 22:52:16,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 22:52:16,446 INFO L87 Difference]: Start difference. First operand 83 states and 133 transitions. cyclomatic complexity: 52 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:52:16,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:52:16,500 INFO L93 Difference]: Finished difference Result 162 states and 258 transitions. [2021-11-02 22:52:16,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 22:52:16,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162 states and 258 transitions. [2021-11-02 22:52:16,512 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 160 [2021-11-02 22:52:16,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162 states to 162 states and 258 transitions. [2021-11-02 22:52:16,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 162 [2021-11-02 22:52:16,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2021-11-02 22:52:16,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 162 states and 258 transitions. [2021-11-02 22:52:16,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:52:16,519 INFO L681 BuchiCegarLoop]: Abstraction has 162 states and 258 transitions. [2021-11-02 22:52:16,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states and 258 transitions. [2021-11-02 22:52:16,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2021-11-02 22:52:16,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 162 states have (on average 1.5925925925925926) internal successors, (258), 161 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:52:16,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 258 transitions. [2021-11-02 22:52:16,540 INFO L704 BuchiCegarLoop]: Abstraction has 162 states and 258 transitions. [2021-11-02 22:52:16,540 INFO L587 BuchiCegarLoop]: Abstraction has 162 states and 258 transitions. [2021-11-02 22:52:16,541 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-11-02 22:52:16,541 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 162 states and 258 transitions. [2021-11-02 22:52:16,543 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 160 [2021-11-02 22:52:16,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:52:16,544 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:52:16,545 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-02 22:52:16,545 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] [2021-11-02 22:52:16,545 INFO L791 eck$LassoCheckResult]: Stem: 434#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 407#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 406#L197-1 [2021-11-02 22:52:16,546 INFO L793 eck$LassoCheckResult]: Loop: 406#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 422#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 454#L83 assume !(0 != main_~p1~0); 515#L83-2 assume !(0 != main_~p2~0); 413#L87-1 assume !(0 != main_~p3~0); 401#L91-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 402#L95-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 425#L99-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 414#L103-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 415#L107-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 467#L111-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 468#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 463#L119-1 assume !(0 != main_~p11~0); 464#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 437#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 438#L131-1 assume !(0 != main_~p1~0); 509#L137-1 assume !(0 != main_~p2~0); 553#L142-1 assume !(0 != main_~p3~0); 551#L147-1 assume !(0 != main_~p4~0); 549#L152-1 assume !(0 != main_~p5~0); 547#L157-1 assume !(0 != main_~p6~0); 545#L162-1 assume !(0 != main_~p7~0); 543#L167-1 assume !(0 != main_~p8~0); 540#L172-1 assume !(0 != main_~p9~0); 539#L177-1 assume !(0 != main_~p10~0); 537#L182-1 assume !(0 != main_~p11~0); 523#L187-1 assume !(0 != main_~p12~0); 451#L192-1 assume !(0 != main_~p13~0); 406#L197-1 [2021-11-02 22:52:16,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:52:16,547 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-11-02 22:52:16,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:52:16,547 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061519791] [2021-11-02 22:52:16,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:52:16,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:52:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:52:16,562 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:52:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:52:16,582 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:52:16,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:52:16,583 INFO L85 PathProgramCache]: Analyzing trace with hash 406535477, now seen corresponding path program 1 times [2021-11-02 22:52:16,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:52:16,583 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395548958] [2021-11-02 22:52:16,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:52:16,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:52:16,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:52:16,652 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-02 22:52:16,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:52:16,653 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395548958] [2021-11-02 22:52:16,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395548958] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:52:16,653 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:52:16,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 22:52:16,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126428240] [2021-11-02 22:52:16,654 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-02 22:52:16,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:52:16,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 22:52:16,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 22:52:16,656 INFO L87 Difference]: Start difference. First operand 162 states and 258 transitions. cyclomatic complexity: 100 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:52:16,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:52:16,681 INFO L93 Difference]: Finished difference Result 318 states and 502 transitions. [2021-11-02 22:52:16,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 22:52:16,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 318 states and 502 transitions. [2021-11-02 22:52:16,688 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 316 [2021-11-02 22:52:16,693 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 318 states to 318 states and 502 transitions. [2021-11-02 22:52:16,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 318 [2021-11-02 22:52:16,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 318 [2021-11-02 22:52:16,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 318 states and 502 transitions. [2021-11-02 22:52:16,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:52:16,698 INFO L681 BuchiCegarLoop]: Abstraction has 318 states and 502 transitions. [2021-11-02 22:52:16,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states and 502 transitions. [2021-11-02 22:52:16,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2021-11-02 22:52:16,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 318 states have (on average 1.578616352201258) internal successors, (502), 317 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:52:16,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 502 transitions. [2021-11-02 22:52:16,760 INFO L704 BuchiCegarLoop]: Abstraction has 318 states and 502 transitions. [2021-11-02 22:52:16,761 INFO L587 BuchiCegarLoop]: Abstraction has 318 states and 502 transitions. [2021-11-02 22:52:16,761 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-11-02 22:52:16,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 318 states and 502 transitions. [2021-11-02 22:52:16,765 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 316 [2021-11-02 22:52:16,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:52:16,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:52:16,767 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-02 22:52:16,767 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] [2021-11-02 22:52:16,767 INFO L791 eck$LassoCheckResult]: Stem: 920#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 893#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 894#L197-1 [2021-11-02 22:52:16,767 INFO L793 eck$LassoCheckResult]: Loop: 894#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 1033#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 1031#L83 assume !(0 != main_~p1~0); 1029#L83-2 assume !(0 != main_~p2~0); 1030#L87-1 assume !(0 != main_~p3~0); 1101#L91-1 assume !(0 != main_~p4~0); 1100#L95-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 1097#L99-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1094#L103-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1091#L107-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1088#L111-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1086#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1083#L119-1 assume !(0 != main_~p11~0); 1081#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 1077#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 1073#L131-1 assume !(0 != main_~p1~0); 1068#L137-1 assume !(0 != main_~p2~0); 1021#L142-1 assume !(0 != main_~p3~0); 1020#L147-1 assume !(0 != main_~p4~0); 1060#L152-1 assume !(0 != main_~p5~0); 1056#L157-1 assume !(0 != main_~p6~0); 1052#L162-1 assume !(0 != main_~p7~0); 1048#L167-1 assume !(0 != main_~p8~0); 1044#L172-1 assume !(0 != main_~p9~0); 1042#L177-1 assume !(0 != main_~p10~0); 1039#L182-1 assume !(0 != main_~p11~0); 1036#L187-1 assume !(0 != main_~p12~0); 1035#L192-1 assume !(0 != main_~p13~0); 894#L197-1 [2021-11-02 22:52:16,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:52:16,768 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-11-02 22:52:16,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:52:16,769 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754258587] [2021-11-02 22:52:16,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:52:16,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:52:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:52:16,782 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:52:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:52:16,799 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:52:16,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:52:16,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1398902857, now seen corresponding path program 1 times [2021-11-02 22:52:16,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:52:16,801 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985440578] [2021-11-02 22:52:16,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:52:16,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:52:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:52:16,839 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-02 22:52:16,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:52:16,840 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985440578] [2021-11-02 22:52:16,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985440578] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:52:16,840 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:52:16,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 22:52:16,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598917282] [2021-11-02 22:52:16,841 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-02 22:52:16,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:52:16,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 22:52:16,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 22:52:16,843 INFO L87 Difference]: Start difference. First operand 318 states and 502 transitions. cyclomatic complexity: 192 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:52:16,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:52:16,894 INFO L93 Difference]: Finished difference Result 626 states and 978 transitions. [2021-11-02 22:52:16,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 22:52:16,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 626 states and 978 transitions. [2021-11-02 22:52:16,904 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 624 [2021-11-02 22:52:16,915 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 626 states to 626 states and 978 transitions. [2021-11-02 22:52:16,915 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 626 [2021-11-02 22:52:16,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 626 [2021-11-02 22:52:16,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 626 states and 978 transitions. [2021-11-02 22:52:16,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:52:16,924 INFO L681 BuchiCegarLoop]: Abstraction has 626 states and 978 transitions. [2021-11-02 22:52:16,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states and 978 transitions. [2021-11-02 22:52:16,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2021-11-02 22:52:16,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 626 states have (on average 1.5623003194888179) internal successors, (978), 625 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:52:16,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 978 transitions. [2021-11-02 22:52:16,995 INFO L704 BuchiCegarLoop]: Abstraction has 626 states and 978 transitions. [2021-11-02 22:52:16,995 INFO L587 BuchiCegarLoop]: Abstraction has 626 states and 978 transitions. [2021-11-02 22:52:16,995 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-11-02 22:52:16,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 626 states and 978 transitions. [2021-11-02 22:52:17,001 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 624 [2021-11-02 22:52:17,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:52:17,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:52:17,002 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-02 22:52:17,002 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] [2021-11-02 22:52:17,002 INFO L791 eck$LassoCheckResult]: Stem: 1873#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1843#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 1844#L197-1 [2021-11-02 22:52:17,003 INFO L793 eck$LassoCheckResult]: Loop: 1844#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 1950#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 1948#L83 assume !(0 != main_~p1~0); 1944#L83-2 assume !(0 != main_~p2~0); 1942#L87-1 assume !(0 != main_~p3~0); 1938#L91-1 assume !(0 != main_~p4~0); 1935#L95-1 assume !(0 != main_~p5~0); 1933#L99-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1931#L103-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1929#L107-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1927#L111-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1925#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1923#L119-1 assume !(0 != main_~p11~0); 1921#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 1919#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 1916#L131-1 assume !(0 != main_~p1~0); 1917#L137-1 assume !(0 != main_~p2~0); 1994#L142-1 assume !(0 != main_~p3~0); 1989#L147-1 assume !(0 != main_~p4~0); 1985#L152-1 assume !(0 != main_~p5~0); 1982#L157-1 assume !(0 != main_~p6~0); 1978#L162-1 assume !(0 != main_~p7~0); 1974#L167-1 assume !(0 != main_~p8~0); 1969#L172-1 assume !(0 != main_~p9~0); 1966#L177-1 assume !(0 != main_~p10~0); 1962#L182-1 assume !(0 != main_~p11~0); 1957#L187-1 assume !(0 != main_~p12~0); 1954#L192-1 assume !(0 != main_~p13~0); 1844#L197-1 [2021-11-02 22:52:17,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:52:17,003 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-11-02 22:52:17,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:52:17,004 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422809756] [2021-11-02 22:52:17,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:52:17,004 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:52:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:52:17,016 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:52:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:52:17,041 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:52:17,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:52:17,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1180048139, now seen corresponding path program 1 times [2021-11-02 22:52:17,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:52:17,043 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582915182] [2021-11-02 22:52:17,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:52:17,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:52:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:52:17,103 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-02 22:52:17,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:52:17,103 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582915182] [2021-11-02 22:52:17,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582915182] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:52:17,104 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:52:17,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 22:52:17,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63935425] [2021-11-02 22:52:17,105 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-02 22:52:17,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:52:17,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 22:52:17,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 22:52:17,107 INFO L87 Difference]: Start difference. First operand 626 states and 978 transitions. cyclomatic complexity: 368 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:52:17,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:52:17,134 INFO L93 Difference]: Finished difference Result 1234 states and 1906 transitions. [2021-11-02 22:52:17,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 22:52:17,135 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1234 states and 1906 transitions. [2021-11-02 22:52:17,154 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1232 [2021-11-02 22:52:17,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1234 states to 1234 states and 1906 transitions. [2021-11-02 22:52:17,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1234 [2021-11-02 22:52:17,172 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1234 [2021-11-02 22:52:17,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1234 states and 1906 transitions. [2021-11-02 22:52:17,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:52:17,176 INFO L681 BuchiCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2021-11-02 22:52:17,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states and 1906 transitions. [2021-11-02 22:52:17,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1234. [2021-11-02 22:52:17,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 1234 states have (on average 1.5445705024311183) internal successors, (1906), 1233 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:52:17,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 1906 transitions. [2021-11-02 22:52:17,240 INFO L704 BuchiCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2021-11-02 22:52:17,240 INFO L587 BuchiCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2021-11-02 22:52:17,240 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-11-02 22:52:17,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1234 states and 1906 transitions. [2021-11-02 22:52:17,253 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1232 [2021-11-02 22:52:17,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:52:17,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:52:17,256 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-02 22:52:17,257 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] [2021-11-02 22:52:17,258 INFO L791 eck$LassoCheckResult]: Stem: 3735#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 3709#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 3710#L197-1 [2021-11-02 22:52:17,258 INFO L793 eck$LassoCheckResult]: Loop: 3710#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 3841#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 3837#L83 assume !(0 != main_~p1~0); 3830#L83-2 assume !(0 != main_~p2~0); 3825#L87-1 assume !(0 != main_~p3~0); 3818#L91-1 assume !(0 != main_~p4~0); 3810#L95-1 assume !(0 != main_~p5~0); 3804#L99-1 assume !(0 != main_~p6~0); 3799#L103-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 3796#L107-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 3793#L111-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 3790#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 3787#L119-1 assume !(0 != main_~p11~0); 3784#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 3780#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 3781#L131-1 assume !(0 != main_~p1~0); 3908#L137-1 assume !(0 != main_~p2~0); 3904#L142-1 assume !(0 != main_~p3~0); 3894#L147-1 assume !(0 != main_~p4~0); 3889#L152-1 assume !(0 != main_~p5~0); 3887#L157-1 assume !(0 != main_~p6~0); 3886#L162-1 assume !(0 != main_~p7~0); 3884#L167-1 assume !(0 != main_~p8~0); 3877#L172-1 assume !(0 != main_~p9~0); 3866#L177-1 assume !(0 != main_~p10~0); 3858#L182-1 assume !(0 != main_~p11~0); 3853#L187-1 assume !(0 != main_~p12~0); 3850#L192-1 assume !(0 != main_~p13~0); 3710#L197-1 [2021-11-02 22:52:17,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:52:17,259 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-11-02 22:52:17,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:52:17,260 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150962527] [2021-11-02 22:52:17,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:52:17,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:52:17,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:52:17,280 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:52:17,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:52:17,294 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:52:17,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:52:17,295 INFO L85 PathProgramCache]: Analyzing trace with hash -757346313, now seen corresponding path program 1 times [2021-11-02 22:52:17,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:52:17,295 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103607194] [2021-11-02 22:52:17,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:52:17,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:52:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:52:17,325 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-02 22:52:17,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:52:17,326 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103607194] [2021-11-02 22:52:17,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103607194] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:52:17,326 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:52:17,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 22:52:17,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482861529] [2021-11-02 22:52:17,327 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-02 22:52:17,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:52:17,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 22:52:17,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 22:52:17,328 INFO L87 Difference]: Start difference. First operand 1234 states and 1906 transitions. cyclomatic complexity: 704 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:52:17,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:52:17,361 INFO L93 Difference]: Finished difference Result 2434 states and 3714 transitions. [2021-11-02 22:52:17,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 22:52:17,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2434 states and 3714 transitions. [2021-11-02 22:52:17,435 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2432 [2021-11-02 22:52:17,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2434 states to 2434 states and 3714 transitions. [2021-11-02 22:52:17,465 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2434 [2021-11-02 22:52:17,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2434 [2021-11-02 22:52:17,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2434 states and 3714 transitions. [2021-11-02 22:52:17,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:52:17,475 INFO L681 BuchiCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2021-11-02 22:52:17,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states and 3714 transitions. [2021-11-02 22:52:17,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2434. [2021-11-02 22:52:17,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 2434 states have (on average 1.5258833196384551) internal successors, (3714), 2433 states have internal predecessors, (3714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:52:17,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 3714 transitions. [2021-11-02 22:52:17,559 INFO L704 BuchiCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2021-11-02 22:52:17,559 INFO L587 BuchiCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2021-11-02 22:52:17,560 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-11-02 22:52:17,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2434 states and 3714 transitions. [2021-11-02 22:52:17,584 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2432 [2021-11-02 22:52:17,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:52:17,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:52:17,587 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-02 22:52:17,587 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] [2021-11-02 22:52:17,587 INFO L791 eck$LassoCheckResult]: Stem: 7410#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 7383#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 7384#L197-1 [2021-11-02 22:52:17,588 INFO L793 eck$LassoCheckResult]: Loop: 7384#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 7625#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 7624#L83 assume !(0 != main_~p1~0); 7593#L83-2 assume !(0 != main_~p2~0); 7590#L87-1 assume !(0 != main_~p3~0); 7582#L91-1 assume !(0 != main_~p4~0); 7531#L95-1 assume !(0 != main_~p5~0); 7490#L99-1 assume !(0 != main_~p6~0); 7491#L103-1 assume !(0 != main_~p7~0); 7731#L107-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 7726#L111-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 7724#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 7722#L119-1 assume !(0 != main_~p11~0); 7718#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 7712#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 7705#L131-1 assume !(0 != main_~p1~0); 7654#L137-1 assume !(0 != main_~p2~0); 7651#L142-1 assume !(0 != main_~p3~0); 7648#L147-1 assume !(0 != main_~p4~0); 7646#L152-1 assume !(0 != main_~p5~0); 7644#L157-1 assume !(0 != main_~p6~0); 7642#L162-1 assume !(0 != main_~p7~0); 7641#L167-1 assume !(0 != main_~p8~0); 7638#L172-1 assume !(0 != main_~p9~0); 7637#L177-1 assume !(0 != main_~p10~0); 7635#L182-1 assume !(0 != main_~p11~0); 7632#L187-1 assume !(0 != main_~p12~0); 7631#L192-1 assume !(0 != main_~p13~0); 7384#L197-1 [2021-11-02 22:52:17,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:52:17,588 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-11-02 22:52:17,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:52:17,589 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608870005] [2021-11-02 22:52:17,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:52:17,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:52:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:52:17,599 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:52:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:52:17,634 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:52:17,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:52:17,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1574994763, now seen corresponding path program 1 times [2021-11-02 22:52:17,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:52:17,643 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857278398] [2021-11-02 22:52:17,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:52:17,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:52:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:52:17,701 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-02 22:52:17,702 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:52:17,702 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857278398] [2021-11-02 22:52:17,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857278398] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:52:17,702 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:52:17,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 22:52:17,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245445255] [2021-11-02 22:52:17,703 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-02 22:52:17,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:52:17,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 22:52:17,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 22:52:17,704 INFO L87 Difference]: Start difference. First operand 2434 states and 3714 transitions. cyclomatic complexity: 1344 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:52:17,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:52:17,757 INFO L93 Difference]: Finished difference Result 4802 states and 7234 transitions. [2021-11-02 22:52:17,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 22:52:17,757 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4802 states and 7234 transitions. [2021-11-02 22:52:17,816 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4800 [2021-11-02 22:52:17,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4802 states to 4802 states and 7234 transitions. [2021-11-02 22:52:17,909 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4802 [2021-11-02 22:52:17,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4802 [2021-11-02 22:52:17,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4802 states and 7234 transitions. [2021-11-02 22:52:17,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:52:17,928 INFO L681 BuchiCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2021-11-02 22:52:17,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4802 states and 7234 transitions. [2021-11-02 22:52:18,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4802 to 4802. [2021-11-02 22:52:18,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4802 states, 4802 states have (on average 1.5064556434818825) internal successors, (7234), 4801 states have internal predecessors, (7234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:52:18,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4802 states to 4802 states and 7234 transitions. [2021-11-02 22:52:18,103 INFO L704 BuchiCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2021-11-02 22:52:18,103 INFO L587 BuchiCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2021-11-02 22:52:18,103 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-11-02 22:52:18,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4802 states and 7234 transitions. [2021-11-02 22:52:18,143 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4800 [2021-11-02 22:52:18,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:52:18,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:52:18,147 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-02 22:52:18,147 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] [2021-11-02 22:52:18,148 INFO L791 eck$LassoCheckResult]: Stem: 14651#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 14625#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 14626#L197-1 [2021-11-02 22:52:18,148 INFO L793 eck$LassoCheckResult]: Loop: 14626#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 15042#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 15039#L83 assume !(0 != main_~p1~0); 15035#L83-2 assume !(0 != main_~p2~0); 15032#L87-1 assume !(0 != main_~p3~0); 15029#L91-1 assume !(0 != main_~p4~0); 15025#L95-1 assume !(0 != main_~p5~0); 15021#L99-1 assume !(0 != main_~p6~0); 15022#L103-1 assume !(0 != main_~p7~0); 15100#L107-1 assume !(0 != main_~p8~0); 15098#L111-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 15096#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 15094#L119-1 assume !(0 != main_~p11~0); 15092#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 15090#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 15087#L131-1 assume !(0 != main_~p1~0); 15083#L137-1 assume !(0 != main_~p2~0); 15080#L142-1 assume !(0 != main_~p3~0); 15075#L147-1 assume !(0 != main_~p4~0); 15071#L152-1 assume !(0 != main_~p5~0); 15069#L157-1 assume !(0 != main_~p6~0); 15068#L162-1 assume !(0 != main_~p7~0); 15066#L167-1 assume !(0 != main_~p8~0); 15062#L172-1 assume !(0 != main_~p9~0); 15059#L177-1 assume !(0 != main_~p10~0); 15055#L182-1 assume !(0 != main_~p11~0); 15050#L187-1 assume !(0 != main_~p12~0); 15047#L192-1 assume !(0 != main_~p13~0); 14626#L197-1 [2021-11-02 22:52:18,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:52:18,149 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-11-02 22:52:18,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:52:18,150 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116301930] [2021-11-02 22:52:18,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:52:18,150 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:52:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:52:18,169 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:52:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:52:18,202 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:52:18,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:52:18,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1031028791, now seen corresponding path program 1 times [2021-11-02 22:52:18,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:52:18,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980042079] [2021-11-02 22:52:18,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:52:18,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:52:18,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:52:18,230 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-02 22:52:18,231 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:52:18,231 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980042079] [2021-11-02 22:52:18,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980042079] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:52:18,231 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:52:18,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 22:52:18,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187685676] [2021-11-02 22:52:18,232 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-02 22:52:18,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:52:18,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 22:52:18,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 22:52:18,234 INFO L87 Difference]: Start difference. First operand 4802 states and 7234 transitions. cyclomatic complexity: 2560 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:52:18,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:52:18,351 INFO L93 Difference]: Finished difference Result 9474 states and 14082 transitions. [2021-11-02 22:52:18,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 22:52:18,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9474 states and 14082 transitions. [2021-11-02 22:52:18,441 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 9472 [2021-11-02 22:52:18,544 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9474 states to 9474 states and 14082 transitions. [2021-11-02 22:52:18,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9474 [2021-11-02 22:52:18,553 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9474 [2021-11-02 22:52:18,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9474 states and 14082 transitions. [2021-11-02 22:52:18,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:52:18,661 INFO L681 BuchiCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2021-11-02 22:52:18,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9474 states and 14082 transitions. [2021-11-02 22:52:18,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9474 to 9474. [2021-11-02 22:52:19,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9474 states, 9474 states have (on average 1.486383787207093) internal successors, (14082), 9473 states have internal predecessors, (14082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:52:19,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9474 states to 9474 states and 14082 transitions. [2021-11-02 22:52:19,199 INFO L704 BuchiCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2021-11-02 22:52:19,199 INFO L587 BuchiCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2021-11-02 22:52:19,199 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-11-02 22:52:19,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9474 states and 14082 transitions. [2021-11-02 22:52:19,257 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 9472 [2021-11-02 22:52:19,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:52:19,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:52:19,258 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-02 22:52:19,258 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] [2021-11-02 22:52:19,259 INFO L791 eck$LassoCheckResult]: Stem: 28933#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 28907#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 28908#L197-1 [2021-11-02 22:52:19,261 INFO L793 eck$LassoCheckResult]: Loop: 28908#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 29641#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 29642#L83 assume !(0 != main_~p1~0); 29625#L83-2 assume !(0 != main_~p2~0); 29627#L87-1 assume !(0 != main_~p3~0); 29609#L91-1 assume !(0 != main_~p4~0); 29611#L95-1 assume !(0 != main_~p5~0); 29776#L99-1 assume !(0 != main_~p6~0); 29773#L103-1 assume !(0 != main_~p7~0); 29769#L107-1 assume !(0 != main_~p8~0); 29762#L111-1 assume !(0 != main_~p9~0); 29757#L115-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 29753#L119-1 assume !(0 != main_~p11~0); 29749#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 29745#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 29738#L131-1 assume !(0 != main_~p1~0); 29728#L137-1 assume !(0 != main_~p2~0); 29722#L142-1 assume !(0 != main_~p3~0); 29714#L147-1 assume !(0 != main_~p4~0); 29710#L152-1 assume !(0 != main_~p5~0); 29421#L157-1 assume !(0 != main_~p6~0); 29423#L162-1 assume !(0 != main_~p7~0); 29693#L167-1 assume !(0 != main_~p8~0); 29694#L172-1 assume !(0 != main_~p9~0); 29684#L177-1 assume !(0 != main_~p10~0); 29683#L182-1 assume !(0 != main_~p11~0); 29788#L187-1 assume !(0 != main_~p12~0); 29656#L192-1 assume !(0 != main_~p13~0); 28908#L197-1 [2021-11-02 22:52:19,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:52:19,262 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2021-11-02 22:52:19,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:52:19,263 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175808087] [2021-11-02 22:52:19,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:52:19,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:52:19,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:52:19,289 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:52:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:52:19,309 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:52:19,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:52:19,310 INFO L85 PathProgramCache]: Analyzing trace with hash -963115915, now seen corresponding path program 1 times [2021-11-02 22:52:19,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:52:19,311 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465314783] [2021-11-02 22:52:19,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:52:19,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:52:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:52:19,350 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-02 22:52:19,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:52:19,355 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465314783] [2021-11-02 22:52:19,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465314783] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:52:19,356 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:52:19,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 22:52:19,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570252665] [2021-11-02 22:52:19,357 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-02 22:52:19,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:52:19,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 22:52:19,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 22:52:19,359 INFO L87 Difference]: Start difference. First operand 9474 states and 14082 transitions. cyclomatic complexity: 4864 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:52:19,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:52:19,617 INFO L93 Difference]: Finished difference Result 18690 states and 27394 transitions. [2021-11-02 22:52:19,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 22:52:19,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18690 states and 27394 transitions. [2021-11-02 22:52:19,755 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 18688 [2021-11-02 22:52:19,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18690 states to 18690 states and 27394 transitions. [2021-11-02 22:52:19,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18690 [2021-11-02 22:52:19,879 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18690 [2021-11-02 22:52:19,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18690 states and 27394 transitions. [2021-11-02 22:52:19,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:52:19,924 INFO L681 BuchiCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2021-11-02 22:52:19,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18690 states and 27394 transitions. [2021-11-02 22:52:20,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18690 to 18690. [2021-11-02 22:52:20,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18690 states, 18690 states have (on average 1.4657035848047084) internal successors, (27394), 18689 states have internal predecessors, (27394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:52:20,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18690 states to 18690 states and 27394 transitions. [2021-11-02 22:52:20,439 INFO L704 BuchiCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2021-11-02 22:52:20,439 INFO L587 BuchiCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2021-11-02 22:52:20,439 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-11-02 22:52:20,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18690 states and 27394 transitions. [2021-11-02 22:52:20,577 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 18688 [2021-11-02 22:52:20,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:52:20,578 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:52:20,578 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-02 22:52:20,579 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] [2021-11-02 22:52:20,579 INFO L791 eck$LassoCheckResult]: Stem: 57107#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 57077#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 57078#L197-1 [2021-11-02 22:52:20,579 INFO L793 eck$LassoCheckResult]: Loop: 57078#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 57248#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 57244#L83 assume !(0 != main_~p1~0); 57241#L83-2 assume !(0 != main_~p2~0); 57238#L87-1 assume !(0 != main_~p3~0); 57234#L91-1 assume !(0 != main_~p4~0); 57230#L95-1 assume !(0 != main_~p5~0); 57226#L99-1 assume !(0 != main_~p6~0); 57221#L103-1 assume !(0 != main_~p7~0); 57216#L107-1 assume !(0 != main_~p8~0); 57217#L111-1 assume !(0 != main_~p9~0); 57538#L115-1 assume !(0 != main_~p10~0); 57534#L119-1 assume !(0 != main_~p11~0); 57530#L123-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 57526#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 57519#L131-1 assume !(0 != main_~p1~0); 57512#L137-1 assume !(0 != main_~p2~0); 57494#L142-1 assume !(0 != main_~p3~0); 57475#L147-1 assume !(0 != main_~p4~0); 57471#L152-1 assume !(0 != main_~p5~0); 57467#L157-1 assume !(0 != main_~p6~0); 57465#L162-1 assume !(0 != main_~p7~0); 57453#L167-1 assume !(0 != main_~p8~0); 57451#L172-1 assume !(0 != main_~p9~0); 57450#L177-1 assume !(0 != main_~p10~0); 57449#L182-1 assume !(0 != main_~p11~0); 57253#L187-1 assume !(0 != main_~p12~0); 57252#L192-1 assume !(0 != main_~p13~0); 57078#L197-1 [2021-11-02 22:52:20,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:52:20,585 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2021-11-02 22:52:20,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:52:20,586 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96190512] [2021-11-02 22:52:20,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:52:20,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:52:20,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:52:20,604 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:52:20,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:52:20,630 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:52:20,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:52:20,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1743503479, now seen corresponding path program 1 times [2021-11-02 22:52:20,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:52:20,637 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796613412] [2021-11-02 22:52:20,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:52:20,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:52:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:52:20,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-02 22:52:20,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:52:20,697 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796613412] [2021-11-02 22:52:20,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796613412] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:52:20,697 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:52:20,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 22:52:20,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241624596] [2021-11-02 22:52:20,699 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-02 22:52:20,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:52:20,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 22:52:20,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 22:52:20,701 INFO L87 Difference]: Start difference. First operand 18690 states and 27394 transitions. cyclomatic complexity: 9216 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:52:21,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:52:21,068 INFO L93 Difference]: Finished difference Result 36866 states and 53250 transitions. [2021-11-02 22:52:21,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 22:52:21,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36866 states and 53250 transitions. [2021-11-02 22:52:21,360 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 36864 [2021-11-02 22:52:21,677 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36866 states to 36866 states and 53250 transitions. [2021-11-02 22:52:21,677 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36866 [2021-11-02 22:52:21,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36866 [2021-11-02 22:52:21,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36866 states and 53250 transitions. [2021-11-02 22:52:21,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:52:21,791 INFO L681 BuchiCegarLoop]: Abstraction has 36866 states and 53250 transitions. [2021-11-02 22:52:21,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36866 states and 53250 transitions. [2021-11-02 22:52:22,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36866 to 36866. [2021-11-02 22:52:22,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36866 states, 36866 states have (on average 1.4444203330982477) internal successors, (53250), 36865 states have internal predecessors, (53250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:52:22,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36866 states to 36866 states and 53250 transitions. [2021-11-02 22:52:22,701 INFO L704 BuchiCegarLoop]: Abstraction has 36866 states and 53250 transitions. [2021-11-02 22:52:22,701 INFO L587 BuchiCegarLoop]: Abstraction has 36866 states and 53250 transitions. [2021-11-02 22:52:22,701 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-11-02 22:52:22,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36866 states and 53250 transitions. [2021-11-02 22:52:23,062 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 36864 [2021-11-02 22:52:23,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:52:23,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:52:23,064 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-02 22:52:23,064 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] [2021-11-02 22:52:23,064 INFO L791 eck$LassoCheckResult]: Stem: 112669#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 112639#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 112640#L197-1 [2021-11-02 22:52:23,064 INFO L793 eck$LassoCheckResult]: Loop: 112640#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 113657#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 113653#L83 assume !(0 != main_~p1~0); 113649#L83-2 assume !(0 != main_~p2~0); 113647#L87-1 assume !(0 != main_~p3~0); 113643#L91-1 assume !(0 != main_~p4~0); 113639#L95-1 assume !(0 != main_~p5~0); 113635#L99-1 assume !(0 != main_~p6~0); 113631#L103-1 assume !(0 != main_~p7~0); 113627#L107-1 assume !(0 != main_~p8~0); 113623#L111-1 assume !(0 != main_~p9~0); 113624#L115-1 assume !(0 != main_~p10~0); 113702#L119-1 assume !(0 != main_~p11~0); 113699#L123-1 assume !(0 != main_~p12~0); 113697#L127-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 113695#L131-1 assume !(0 != main_~p1~0); 113693#L137-1 assume !(0 != main_~p2~0); 113681#L142-1 assume !(0 != main_~p3~0); 113675#L147-1 assume !(0 != main_~p4~0); 113544#L152-1 assume !(0 != main_~p5~0); 113545#L157-1 assume !(0 != main_~p6~0); 113491#L162-1 assume !(0 != main_~p7~0); 113493#L167-1 assume !(0 != main_~p8~0); 113427#L172-1 assume !(0 != main_~p9~0); 113428#L177-1 assume !(0 != main_~p10~0); 113669#L182-1 assume !(0 != main_~p11~0); 113664#L187-1 assume !(0 != main_~p12~0); 113661#L192-1 assume !(0 != main_~p13~0); 112640#L197-1 [2021-11-02 22:52:23,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:52:23,065 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2021-11-02 22:52:23,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:52:23,066 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347388688] [2021-11-02 22:52:23,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:52:23,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:52:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:52:23,078 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:52:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:52:23,104 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:52:23,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:52:23,105 INFO L85 PathProgramCache]: Analyzing trace with hash 463639801, now seen corresponding path program 1 times [2021-11-02 22:52:23,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:52:23,109 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438126259] [2021-11-02 22:52:23,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:52:23,114 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:52:23,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:52:23,141 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-02 22:52:23,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:52:23,142 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438126259] [2021-11-02 22:52:23,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438126259] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:52:23,145 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:52:23,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-02 22:52:23,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516735206] [2021-11-02 22:52:23,146 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-02 22:52:23,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:52:23,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 22:52:23,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 22:52:23,150 INFO L87 Difference]: Start difference. First operand 36866 states and 53250 transitions. cyclomatic complexity: 17408 Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:52:23,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:52:23,485 INFO L93 Difference]: Finished difference Result 72706 states and 103426 transitions. [2021-11-02 22:52:23,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 22:52:23,486 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72706 states and 103426 transitions. [2021-11-02 22:52:24,155 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 72704 [2021-11-02 22:52:24,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72706 states to 72706 states and 103426 transitions. [2021-11-02 22:52:24,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72706 [2021-11-02 22:52:24,510 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72706 [2021-11-02 22:52:24,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72706 states and 103426 transitions. [2021-11-02 22:52:24,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 22:52:24,569 INFO L681 BuchiCegarLoop]: Abstraction has 72706 states and 103426 transitions. [2021-11-02 22:52:24,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72706 states and 103426 transitions. [2021-11-02 22:52:25,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72706 to 72706. [2021-11-02 22:52:25,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72706 states, 72706 states have (on average 1.4225235881495337) internal successors, (103426), 72705 states have internal predecessors, (103426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:52:26,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72706 states to 72706 states and 103426 transitions. [2021-11-02 22:52:26,533 INFO L704 BuchiCegarLoop]: Abstraction has 72706 states and 103426 transitions. [2021-11-02 22:52:26,533 INFO L587 BuchiCegarLoop]: Abstraction has 72706 states and 103426 transitions. [2021-11-02 22:52:26,534 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-11-02 22:52:26,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72706 states and 103426 transitions. [2021-11-02 22:52:26,738 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 72704 [2021-11-02 22:52:26,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-02 22:52:26,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-02 22:52:26,739 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-02 22:52:26,739 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] [2021-11-02 22:52:26,740 INFO L791 eck$LassoCheckResult]: Stem: 222245#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 222217#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;havoc main_~cond~0; 222218#L197-1 [2021-11-02 22:52:26,740 INFO L793 eck$LassoCheckResult]: Loop: 222218#L197-1 assume !false;main_~cond~0 := main_#t~nondet20;havoc main_#t~nondet20; 223381#L52 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 223379#L83 assume !(0 != main_~p1~0); 223377#L83-2 assume !(0 != main_~p2~0); 223376#L87-1 assume !(0 != main_~p3~0); 223374#L91-1 assume !(0 != main_~p4~0); 223372#L95-1 assume !(0 != main_~p5~0); 223370#L99-1 assume !(0 != main_~p6~0); 223368#L103-1 assume !(0 != main_~p7~0); 223366#L107-1 assume !(0 != main_~p8~0); 223364#L111-1 assume !(0 != main_~p9~0); 223362#L115-1 assume !(0 != main_~p10~0); 223360#L119-1 assume !(0 != main_~p11~0); 223357#L123-1 assume !(0 != main_~p12~0); 223358#L127-1 assume !(0 != main_~p13~0); 223341#L131-1 assume !(0 != main_~p1~0); 223343#L137-1 assume !(0 != main_~p2~0); 223327#L142-1 assume !(0 != main_~p3~0); 223326#L147-1 assume !(0 != main_~p4~0); 223309#L152-1 assume !(0 != main_~p5~0); 223310#L157-1 assume !(0 != main_~p6~0); 223291#L162-1 assume !(0 != main_~p7~0); 223293#L167-1 assume !(0 != main_~p8~0); 223278#L172-1 assume !(0 != main_~p9~0); 223279#L177-1 assume !(0 != main_~p10~0); 223267#L182-1 assume !(0 != main_~p11~0); 223266#L187-1 assume !(0 != main_~p12~0); 223382#L192-1 assume !(0 != main_~p13~0); 222218#L197-1 [2021-11-02 22:52:26,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:52:26,740 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2021-11-02 22:52:26,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:52:26,741 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66475368] [2021-11-02 22:52:26,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:52:26,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:52:26,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:52:26,748 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:52:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:52:26,757 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:52:26,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:52:26,758 INFO L85 PathProgramCache]: Analyzing trace with hash -547477449, now seen corresponding path program 1 times [2021-11-02 22:52:26,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:52:26,759 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718752598] [2021-11-02 22:52:26,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:52:26,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:52:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:52:26,764 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:52:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:52:26,776 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:52:26,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:52:26,777 INFO L85 PathProgramCache]: Analyzing trace with hash 496424185, now seen corresponding path program 1 times [2021-11-02 22:52:26,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:52:26,778 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249820885] [2021-11-02 22:52:26,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:52:26,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:52:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:52:26,787 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:52:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:52:26,802 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:52:27,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.11 10:52:27 BoogieIcfgContainer [2021-11-02 22:52:27,812 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-11-02 22:52:27,812 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-02 22:52:27,812 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-02 22:52:27,813 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-02 22:52:27,813 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:52:15" (3/4) ... [2021-11-02 22:52:27,817 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-11-02 22:52:27,905 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b558703-2725-4753-835f-c672acd93b2d/bin/uautomizer-tBqnrhUYjU/witness.graphml [2021-11-02 22:52:27,906 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-02 22:52:27,908 INFO L168 Benchmark]: Toolchain (without parser) took 13611.93 ms. Allocated memory was 88.1 MB in the beginning and 4.2 GB in the end (delta: 4.1 GB). Free memory was 54.0 MB in the beginning and 3.5 GB in the end (delta: -3.5 GB). Peak memory consumption was 679.7 MB. Max. memory is 16.1 GB. [2021-11-02 22:52:27,908 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 88.1 MB. Free memory was 60.3 MB in the beginning and 60.3 MB in the end (delta: 29.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-02 22:52:27,909 INFO L168 Benchmark]: CACSL2BoogieTranslator took 429.14 ms. Allocated memory is still 88.1 MB. Free memory was 53.8 MB in the beginning and 63.7 MB in the end (delta: -9.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-02 22:52:27,909 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.75 ms. Allocated memory is still 88.1 MB. Free memory was 63.7 MB in the beginning and 62.1 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-02 22:52:27,910 INFO L168 Benchmark]: Boogie Preprocessor took 75.01 ms. Allocated memory is still 88.1 MB. Free memory was 62.1 MB in the beginning and 60.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-02 22:52:27,910 INFO L168 Benchmark]: RCFGBuilder took 463.40 ms. Allocated memory is still 88.1 MB. Free memory was 60.8 MB in the beginning and 47.9 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-11-02 22:52:27,911 INFO L168 Benchmark]: BuchiAutomizer took 12467.47 ms. Allocated memory was 88.1 MB in the beginning and 4.2 GB in the end (delta: 4.1 GB). Free memory was 47.9 MB in the beginning and 3.5 GB in the end (delta: -3.5 GB). Peak memory consumption was 671.9 MB. Max. memory is 16.1 GB. [2021-11-02 22:52:27,911 INFO L168 Benchmark]: Witness Printer took 93.45 ms. Allocated memory is still 4.2 GB. Free memory was 3.5 GB in the beginning and 3.5 GB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-02 22:52:27,914 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.28 ms. Allocated memory is still 88.1 MB. Free memory was 60.3 MB in the beginning and 60.3 MB in the end (delta: 29.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 429.14 ms. Allocated memory is still 88.1 MB. Free memory was 53.8 MB in the beginning and 63.7 MB in the end (delta: -9.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 75.75 ms. Allocated memory is still 88.1 MB. Free memory was 63.7 MB in the beginning and 62.1 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 75.01 ms. Allocated memory is still 88.1 MB. Free memory was 62.1 MB in the beginning and 60.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 463.40 ms. Allocated memory is still 88.1 MB. Free memory was 60.8 MB in the beginning and 47.9 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 12467.47 ms. Allocated memory was 88.1 MB in the beginning and 4.2 GB in the end (delta: 4.1 GB). Free memory was 47.9 MB in the beginning and 3.5 GB in the end (delta: -3.5 GB). Peak memory consumption was 671.9 MB. Max. memory is 16.1 GB. * Witness Printer took 93.45 ms. Allocated memory is still 4.2 GB. Free memory was 3.5 GB in the beginning and 3.5 GB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (11 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.11 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 72706 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.3s and 12 iterations. TraceHistogramMax:1. Analysis of lassos took 2.6s. Construction of modules took 0.1s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 0. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 4.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 2.3s Buchi closure took 0.1s. Biggest automaton had 72706 states and ocurred in iteration 11. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1133 SDtfs, 589 SDslu, 709 SDs, 0 SdLazy, 55 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI11 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 50]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=6437} State at position 1 is {NULL=0, p1=0, p3=0, p5=0, NULL=6437, p10=0, p7=0, p9=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4cf646c3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@34fffbae=0, lk10=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@59af0bd4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@182f1871=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@537269ed=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1e6a3f3c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@276ac504=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1d4b9149=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@63f50c7d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@289ca926=0, NULL=0, NULL=0, lk3=0, lk5=0, NULL=0, lk1=0, lk7=0, lk9=0, NULL=6440, \result=0, p2=0, p4=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3f58e526=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@24b6f61b=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1a8413eb=0, lk13=0, p13=0, p11=0, lk11=0, cond=9, NULL=6438, NULL=0, NULL=6439, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3fba668e=9, lk4=0, lk6=0, lk2=0, lk8=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 50]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L48] int cond; Loop: [L50] COND TRUE 1 [L51] cond = __VERIFIER_nondet_int() [L52] COND FALSE !(cond == 0) [L55] lk1 = 0 [L57] lk2 = 0 [L59] lk3 = 0 [L61] lk4 = 0 [L63] lk5 = 0 [L65] lk6 = 0 [L67] lk7 = 0 [L69] lk8 = 0 [L71] lk9 = 0 [L73] lk10 = 0 [L75] lk11 = 0 [L77] lk12 = 0 [L79] lk13 = 0 [L83] COND FALSE !(p1 != 0) [L87] COND FALSE !(p2 != 0) [L91] COND FALSE !(p3 != 0) [L95] COND FALSE !(p4 != 0) [L99] COND FALSE !(p5 != 0) [L103] COND FALSE !(p6 != 0) [L107] COND FALSE !(p7 != 0) [L111] COND FALSE !(p8 != 0) [L115] COND FALSE !(p9 != 0) [L119] COND FALSE !(p10 != 0) [L123] COND FALSE !(p11 != 0) [L127] COND FALSE !(p12 != 0) [L131] COND FALSE !(p13 != 0) [L137] COND FALSE !(p1 != 0) [L142] COND FALSE !(p2 != 0) [L147] COND FALSE !(p3 != 0) [L152] COND FALSE !(p4 != 0) [L157] COND FALSE !(p5 != 0) [L162] COND FALSE !(p6 != 0) [L167] COND FALSE !(p7 != 0) [L172] COND FALSE !(p8 != 0) [L177] COND FALSE !(p9 != 0) [L182] COND FALSE !(p10 != 0) [L187] COND FALSE !(p11 != 0) [L192] COND FALSE !(p12 != 0) [L197] COND FALSE !(p13 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-11-02 22:52:27,983 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b558703-2725-4753-835f-c672acd93b2d/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)