./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_8.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6719e03a-03b1-4170-ad8c-38ccf3b1ef67/bin/uautomizer-j4sWxH34Be/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6719e03a-03b1-4170-ad8c-38ccf3b1ef67/bin/uautomizer-j4sWxH34Be/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6719e03a-03b1-4170-ad8c-38ccf3b1ef67/bin/uautomizer-j4sWxH34Be/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6719e03a-03b1-4170-ad8c-38ccf3b1ef67/bin/uautomizer-j4sWxH34Be/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_8.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6719e03a-03b1-4170-ad8c-38ccf3b1ef67/bin/uautomizer-j4sWxH34Be/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6719e03a-03b1-4170-ad8c-38ccf3b1ef67/bin/uautomizer-j4sWxH34Be --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 b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-e943c26 [2021-10-21 20:17:59,819 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-21 20:17:59,822 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-21 20:17:59,884 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-21 20:17:59,885 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-21 20:17:59,889 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-21 20:17:59,891 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-21 20:17:59,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-21 20:17:59,898 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-21 20:17:59,904 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-21 20:17:59,905 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-21 20:17:59,907 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-21 20:17:59,908 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-21 20:17:59,911 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-21 20:17:59,913 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-21 20:17:59,917 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-21 20:17:59,920 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-21 20:17:59,921 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-21 20:17:59,924 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-21 20:17:59,936 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-21 20:17:59,938 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-21 20:17:59,940 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-21 20:17:59,944 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-21 20:17:59,946 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-21 20:17:59,957 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-21 20:17:59,957 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-21 20:17:59,958 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-21 20:17:59,961 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-21 20:17:59,961 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-21 20:17:59,963 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-21 20:17:59,964 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-21 20:17:59,965 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-21 20:17:59,968 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-21 20:17:59,969 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-21 20:17:59,971 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-21 20:17:59,971 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-21 20:17:59,972 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-21 20:17:59,973 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-21 20:17:59,973 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-21 20:17:59,974 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-21 20:17:59,975 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-21 20:17:59,976 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6719e03a-03b1-4170-ad8c-38ccf3b1ef67/bin/uautomizer-j4sWxH34Be/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-10-21 20:18:00,017 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-21 20:18:00,018 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-21 20:18:00,018 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-21 20:18:00,019 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-21 20:18:00,020 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-21 20:18:00,020 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-21 20:18:00,020 INFO L138 SettingsManager]: * Use SBE=true [2021-10-21 20:18:00,021 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-10-21 20:18:00,021 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-10-21 20:18:00,021 INFO L138 SettingsManager]: * Use old map elimination=false [2021-10-21 20:18:00,022 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-10-21 20:18:00,023 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-10-21 20:18:00,023 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-10-21 20:18:00,023 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-21 20:18:00,023 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-21 20:18:00,023 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-21 20:18:00,024 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-21 20:18:00,024 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-21 20:18:00,024 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-21 20:18:00,024 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-10-21 20:18:00,024 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-10-21 20:18:00,025 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-10-21 20:18:00,025 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-21 20:18:00,025 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-21 20:18:00,025 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-10-21 20:18:00,026 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-21 20:18:00,027 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-10-21 20:18:00,028 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-21 20:18:00,028 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-21 20:18:00,028 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-21 20:18:00,028 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-21 20:18:00,029 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-21 20:18:00,030 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-10-21 20:18:00,030 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_6719e03a-03b1-4170-ad8c-38ccf3b1ef67/bin/uautomizer-j4sWxH34Be/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_6719e03a-03b1-4170-ad8c-38ccf3b1ef67/bin/uautomizer-j4sWxH34Be 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 -> b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 [2021-10-21 20:18:00,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-21 20:18:00,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-21 20:18:00,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-21 20:18:00,411 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-21 20:18:00,412 INFO L275 PluginConnector]: CDTParser initialized [2021-10-21 20:18:00,413 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6719e03a-03b1-4170-ad8c-38ccf3b1ef67/bin/uautomizer-j4sWxH34Be/../../sv-benchmarks/c/locks/test_locks_8.c [2021-10-21 20:18:00,508 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6719e03a-03b1-4170-ad8c-38ccf3b1ef67/bin/uautomizer-j4sWxH34Be/data/893101864/a46626320af0445aa6d24b7a2a9b736a/FLAG16b9c6007 [2021-10-21 20:18:01,018 INFO L306 CDTParser]: Found 1 translation units. [2021-10-21 20:18:01,019 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6719e03a-03b1-4170-ad8c-38ccf3b1ef67/sv-benchmarks/c/locks/test_locks_8.c [2021-10-21 20:18:01,028 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6719e03a-03b1-4170-ad8c-38ccf3b1ef67/bin/uautomizer-j4sWxH34Be/data/893101864/a46626320af0445aa6d24b7a2a9b736a/FLAG16b9c6007 [2021-10-21 20:18:01,382 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6719e03a-03b1-4170-ad8c-38ccf3b1ef67/bin/uautomizer-j4sWxH34Be/data/893101864/a46626320af0445aa6d24b7a2a9b736a [2021-10-21 20:18:01,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-21 20:18:01,387 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-21 20:18:01,389 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-21 20:18:01,390 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-21 20:18:01,394 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-21 20:18:01,395 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 08:18:01" (1/1) ... [2021-10-21 20:18:01,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67a067c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:18:01, skipping insertion in model container [2021-10-21 20:18:01,397 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 08:18:01" (1/1) ... [2021-10-21 20:18:01,406 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-21 20:18:01,433 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-21 20:18:01,632 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_6719e03a-03b1-4170-ad8c-38ccf3b1ef67/sv-benchmarks/c/locks/test_locks_8.c[3218,3231] [2021-10-21 20:18:01,634 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 20:18:01,644 INFO L203 MainTranslator]: Completed pre-run [2021-10-21 20:18:01,690 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_6719e03a-03b1-4170-ad8c-38ccf3b1ef67/sv-benchmarks/c/locks/test_locks_8.c[3218,3231] [2021-10-21 20:18:01,691 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 20:18:01,708 INFO L208 MainTranslator]: Completed translation [2021-10-21 20:18:01,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:18:01 WrapperNode [2021-10-21 20:18:01,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-21 20:18:01,710 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-21 20:18:01,710 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-21 20:18:01,710 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-21 20:18:01,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:18:01" (1/1) ... [2021-10-21 20:18:01,728 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:18:01" (1/1) ... [2021-10-21 20:18:01,751 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-21 20:18:01,752 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-21 20:18:01,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-21 20:18:01,752 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-21 20:18:01,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:18:01" (1/1) ... [2021-10-21 20:18:01,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:18:01" (1/1) ... [2021-10-21 20:18:01,767 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:18:01" (1/1) ... [2021-10-21 20:18:01,767 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:18:01" (1/1) ... [2021-10-21 20:18:01,777 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:18:01" (1/1) ... [2021-10-21 20:18:01,783 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:18:01" (1/1) ... [2021-10-21 20:18:01,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:18:01" (1/1) ... [2021-10-21 20:18:01,788 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-21 20:18:01,789 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-21 20:18:01,789 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-21 20:18:01,789 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-21 20:18:01,791 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:18:01" (1/1) ... [2021-10-21 20:18:01,815 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 20:18:01,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6719e03a-03b1-4170-ad8c-38ccf3b1ef67/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 20:18:01,843 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6719e03a-03b1-4170-ad8c-38ccf3b1ef67/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 20:18:01,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6719e03a-03b1-4170-ad8c-38ccf3b1ef67/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-10-21 20:18:01,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-21 20:18:01,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-21 20:18:01,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-21 20:18:01,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-21 20:18:02,164 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-21 20:18:02,164 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-10-21 20:18:02,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 08:18:02 BoogieIcfgContainer [2021-10-21 20:18:02,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-21 20:18:02,168 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-10-21 20:18:02,168 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-10-21 20:18:02,172 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-10-21 20:18:02,173 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-21 20:18:02,173 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.10 08:18:01" (1/3) ... [2021-10-21 20:18:02,175 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49d7eefc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.10 08:18:02, skipping insertion in model container [2021-10-21 20:18:02,175 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-21 20:18:02,175 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:18:01" (2/3) ... [2021-10-21 20:18:02,176 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49d7eefc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.10 08:18:02, skipping insertion in model container [2021-10-21 20:18:02,176 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-21 20:18:02,176 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 08:18:02" (3/3) ... [2021-10-21 20:18:02,178 INFO L389 chiAutomizerObserver]: Analyzing ICFG test_locks_8.c [2021-10-21 20:18:02,228 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-10-21 20:18:02,228 INFO L360 BuchiCegarLoop]: Hoare is false [2021-10-21 20:18:02,228 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-10-21 20:18:02,229 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-21 20:18:02,229 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-21 20:18:02,229 INFO L364 BuchiCegarLoop]: Difference is false [2021-10-21 20:18:02,229 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-21 20:18:02,229 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-10-21 20:18:02,248 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 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-10-21 20:18:02,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2021-10-21 20:18:02,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 20:18:02,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 20:18:02,281 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-21 20:18:02,282 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:18:02,282 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-10-21 20:18:02,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 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-10-21 20:18:02,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2021-10-21 20:18:02,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 20:18:02,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 20:18:02,308 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-21 20:18:02,309 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:18:02,316 INFO L791 eck$LassoCheckResult]: Stem: 19#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 8#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_~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_~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;havoc main_~cond~0; 22#L127-1true [2021-10-21 20:18:02,317 INFO L793 eck$LassoCheckResult]: Loop: 22#L127-1true assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 29#L37true 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; 7#L58true assume 0 != main_~p1~0;main_~lk1~0 := 1; 14#L58-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 16#L62-1true assume !(0 != main_~p3~0); 30#L66-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 31#L70-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 33#L74-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 27#L78-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 11#L82-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 9#L86-1true assume !(0 != main_~p1~0); 6#L92-1true assume !(0 != main_~p2~0); 17#L97-1true assume !(0 != main_~p3~0); 24#L102-1true assume !(0 != main_~p4~0); 21#L107-1true assume !(0 != main_~p5~0); 34#L112-1true assume !(0 != main_~p6~0); 32#L117-1true assume !(0 != main_~p7~0); 12#L122-1true assume !(0 != main_~p8~0); 22#L127-1true [2021-10-21 20:18:02,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:18:02,323 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-10-21 20:18:02,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:18:02,334 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905693882] [2021-10-21 20:18:02,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:18:02,335 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:18:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:18:02,487 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 20:18:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:18:02,564 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 20:18:02,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:18:02,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1098697512, now seen corresponding path program 1 times [2021-10-21 20:18:02,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:18:02,569 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108650417] [2021-10-21 20:18:02,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:18:02,570 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:18:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:18:02,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:18:02,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:18:02,732 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108650417] [2021-10-21 20:18:02,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108650417] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:18:02,733 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:18:02,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:18:02,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804227920] [2021-10-21 20:18:02,740 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-21 20:18:02,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:18:02,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:18:02,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:18:02,772 INFO L87 Difference]: Start difference. First operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 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 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10-21 20:18:02,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:18:02,840 INFO L93 Difference]: Finished difference Result 63 states and 106 transitions. [2021-10-21 20:18:02,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:18:02,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 106 transitions. [2021-10-21 20:18:02,853 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2021-10-21 20:18:02,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 53 states and 83 transitions. [2021-10-21 20:18:02,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2021-10-21 20:18:02,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2021-10-21 20:18:02,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 83 transitions. [2021-10-21 20:18:02,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:18:02,861 INFO L681 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2021-10-21 20:18:02,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 83 transitions. [2021-10-21 20:18:02,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-10-21 20:18:02,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.5660377358490567) internal successors, (83), 52 states have internal predecessors, (83), 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-10-21 20:18:02,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 83 transitions. [2021-10-21 20:18:02,894 INFO L704 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2021-10-21 20:18:02,894 INFO L587 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2021-10-21 20:18:02,894 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-10-21 20:18:02,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 83 transitions. [2021-10-21 20:18:02,896 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2021-10-21 20:18:02,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 20:18:02,897 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 20:18:02,898 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-21 20:18:02,898 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:18:02,898 INFO L791 eck$LassoCheckResult]: Stem: 125#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 112#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_~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_~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;havoc main_~cond~0; 113#L127-1 [2021-10-21 20:18:02,898 INFO L793 eck$LassoCheckResult]: Loop: 113#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 140#L37 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; 138#L58 assume !(0 != main_~p1~0); 139#L58-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 157#L62-1 assume !(0 != main_~p3~0); 156#L66-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 155#L70-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 154#L74-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 153#L78-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 152#L82-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 151#L86-1 assume !(0 != main_~p1~0); 109#L92-1 assume !(0 != main_~p2~0); 108#L97-1 assume !(0 != main_~p3~0); 123#L102-1 assume !(0 != main_~p4~0); 129#L107-1 assume !(0 != main_~p5~0); 143#L112-1 assume !(0 != main_~p6~0); 137#L117-1 assume !(0 != main_~p7~0); 131#L122-1 assume !(0 != main_~p8~0); 113#L127-1 [2021-10-21 20:18:02,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:18:02,899 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-10-21 20:18:02,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:18:02,900 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527897609] [2021-10-21 20:18:02,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:18:02,901 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:18:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:18:02,928 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 20:18:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:18:02,962 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 20:18:02,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:18:02,963 INFO L82 PathProgramCache]: Analyzing trace with hash 77629158, now seen corresponding path program 1 times [2021-10-21 20:18:02,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:18:02,964 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142492335] [2021-10-21 20:18:02,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:18:02,965 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:18:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:18:03,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:18:03,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:18:03,014 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142492335] [2021-10-21 20:18:03,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142492335] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:18:03,015 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:18:03,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:18:03,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132766995] [2021-10-21 20:18:03,016 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-21 20:18:03,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:18:03,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:18:03,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:18:03,018 INFO L87 Difference]: Start difference. First operand 53 states and 83 transitions. cyclomatic complexity: 32 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10-21 20:18:03,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:18:03,060 INFO L93 Difference]: Finished difference Result 102 states and 158 transitions. [2021-10-21 20:18:03,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:18:03,061 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 158 transitions. [2021-10-21 20:18:03,064 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 100 [2021-10-21 20:18:03,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 102 states and 158 transitions. [2021-10-21 20:18:03,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2021-10-21 20:18:03,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2021-10-21 20:18:03,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 158 transitions. [2021-10-21 20:18:03,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:18:03,069 INFO L681 BuchiCegarLoop]: Abstraction has 102 states and 158 transitions. [2021-10-21 20:18:03,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 158 transitions. [2021-10-21 20:18:03,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2021-10-21 20:18:03,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 102 states have (on average 1.5490196078431373) internal successors, (158), 101 states have internal predecessors, (158), 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-10-21 20:18:03,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 158 transitions. [2021-10-21 20:18:03,090 INFO L704 BuchiCegarLoop]: Abstraction has 102 states and 158 transitions. [2021-10-21 20:18:03,091 INFO L587 BuchiCegarLoop]: Abstraction has 102 states and 158 transitions. [2021-10-21 20:18:03,091 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-10-21 20:18:03,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 158 transitions. [2021-10-21 20:18:03,094 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 100 [2021-10-21 20:18:03,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 20:18:03,094 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 20:18:03,095 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-21 20:18:03,095 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:18:03,096 INFO L791 eck$LassoCheckResult]: Stem: 289#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 273#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_~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_~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;havoc main_~cond~0; 274#L127-1 [2021-10-21 20:18:03,096 INFO L793 eck$LassoCheckResult]: Loop: 274#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 325#L37 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; 323#L58 assume !(0 != main_~p1~0); 320#L58-2 assume !(0 != main_~p2~0); 318#L62-1 assume !(0 != main_~p3~0); 316#L66-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 314#L70-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 312#L74-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 310#L78-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 308#L82-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 306#L86-1 assume !(0 != main_~p1~0); 307#L92-1 assume !(0 != main_~p2~0); 348#L97-1 assume !(0 != main_~p3~0); 345#L102-1 assume !(0 != main_~p4~0); 341#L107-1 assume !(0 != main_~p5~0); 336#L112-1 assume !(0 != main_~p6~0); 333#L117-1 assume !(0 != main_~p7~0); 329#L122-1 assume !(0 != main_~p8~0); 274#L127-1 [2021-10-21 20:18:03,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:18:03,097 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-10-21 20:18:03,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:18:03,097 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657903631] [2021-10-21 20:18:03,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:18:03,098 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:18:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:18:03,131 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 20:18:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:18:03,161 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 20:18:03,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:18:03,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1202234520, now seen corresponding path program 1 times [2021-10-21 20:18:03,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:18:03,163 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166697659] [2021-10-21 20:18:03,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:18:03,165 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:18:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:18:03,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:18:03,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:18:03,219 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166697659] [2021-10-21 20:18:03,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166697659] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:18:03,220 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:18:03,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:18:03,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316864132] [2021-10-21 20:18:03,221 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-21 20:18:03,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:18:03,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:18:03,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:18:03,222 INFO L87 Difference]: Start difference. First operand 102 states and 158 transitions. cyclomatic complexity: 60 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10-21 20:18:03,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:18:03,241 INFO L93 Difference]: Finished difference Result 198 states and 302 transitions. [2021-10-21 20:18:03,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:18:03,241 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 198 states and 302 transitions. [2021-10-21 20:18:03,246 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 196 [2021-10-21 20:18:03,249 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 198 states to 198 states and 302 transitions. [2021-10-21 20:18:03,250 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 198 [2021-10-21 20:18:03,250 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 198 [2021-10-21 20:18:03,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 198 states and 302 transitions. [2021-10-21 20:18:03,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:18:03,253 INFO L681 BuchiCegarLoop]: Abstraction has 198 states and 302 transitions. [2021-10-21 20:18:03,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states and 302 transitions. [2021-10-21 20:18:03,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-10-21 20:18:03,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 198 states have (on average 1.5252525252525253) internal successors, (302), 197 states have internal predecessors, (302), 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-10-21 20:18:03,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 302 transitions. [2021-10-21 20:18:03,287 INFO L704 BuchiCegarLoop]: Abstraction has 198 states and 302 transitions. [2021-10-21 20:18:03,288 INFO L587 BuchiCegarLoop]: Abstraction has 198 states and 302 transitions. [2021-10-21 20:18:03,288 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-10-21 20:18:03,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 198 states and 302 transitions. [2021-10-21 20:18:03,291 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 196 [2021-10-21 20:18:03,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 20:18:03,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 20:18:03,292 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-21 20:18:03,293 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:18:03,293 INFO L791 eck$LassoCheckResult]: Stem: 597#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 580#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_~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_~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;havoc main_~cond~0; 581#L127-1 [2021-10-21 20:18:03,293 INFO L793 eck$LassoCheckResult]: Loop: 581#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 645#L37 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; 638#L58 assume !(0 != main_~p1~0); 639#L58-2 assume !(0 != main_~p2~0); 630#L62-1 assume !(0 != main_~p3~0); 631#L66-1 assume !(0 != main_~p4~0); 701#L70-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 700#L74-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 699#L78-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 698#L82-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 697#L86-1 assume !(0 != main_~p1~0); 694#L92-1 assume !(0 != main_~p2~0); 690#L97-1 assume !(0 != main_~p3~0); 688#L102-1 assume !(0 != main_~p4~0); 676#L107-1 assume !(0 != main_~p5~0); 675#L112-1 assume !(0 != main_~p6~0); 655#L117-1 assume !(0 != main_~p7~0); 654#L122-1 assume !(0 != main_~p8~0); 581#L127-1 [2021-10-21 20:18:03,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:18:03,294 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-10-21 20:18:03,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:18:03,295 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793020098] [2021-10-21 20:18:03,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:18:03,295 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:18:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:18:03,307 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 20:18:03,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:18:03,322 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 20:18:03,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:18:03,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1789040534, now seen corresponding path program 1 times [2021-10-21 20:18:03,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:18:03,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108849088] [2021-10-21 20:18:03,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:18:03,325 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:18:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:18:03,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:18:03,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:18:03,385 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108849088] [2021-10-21 20:18:03,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108849088] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:18:03,385 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:18:03,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:18:03,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339415403] [2021-10-21 20:18:03,387 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-21 20:18:03,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:18:03,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:18:03,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:18:03,390 INFO L87 Difference]: Start difference. First operand 198 states and 302 transitions. cyclomatic complexity: 112 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10-21 20:18:03,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:18:03,421 INFO L93 Difference]: Finished difference Result 386 states and 578 transitions. [2021-10-21 20:18:03,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:18:03,422 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 386 states and 578 transitions. [2021-10-21 20:18:03,430 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 384 [2021-10-21 20:18:03,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 386 states to 386 states and 578 transitions. [2021-10-21 20:18:03,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 386 [2021-10-21 20:18:03,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 386 [2021-10-21 20:18:03,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 386 states and 578 transitions. [2021-10-21 20:18:03,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:18:03,441 INFO L681 BuchiCegarLoop]: Abstraction has 386 states and 578 transitions. [2021-10-21 20:18:03,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states and 578 transitions. [2021-10-21 20:18:03,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2021-10-21 20:18:03,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 386 states have (on average 1.4974093264248705) internal successors, (578), 385 states have internal predecessors, (578), 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-10-21 20:18:03,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 578 transitions. [2021-10-21 20:18:03,468 INFO L704 BuchiCegarLoop]: Abstraction has 386 states and 578 transitions. [2021-10-21 20:18:03,468 INFO L587 BuchiCegarLoop]: Abstraction has 386 states and 578 transitions. [2021-10-21 20:18:03,468 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-10-21 20:18:03,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 386 states and 578 transitions. [2021-10-21 20:18:03,472 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 384 [2021-10-21 20:18:03,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 20:18:03,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 20:18:03,473 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-21 20:18:03,473 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:18:03,473 INFO L791 eck$LassoCheckResult]: Stem: 1186#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1169#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_~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_~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;havoc main_~cond~0; 1170#L127-1 [2021-10-21 20:18:03,474 INFO L793 eck$LassoCheckResult]: Loop: 1170#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 1273#L37 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; 1266#L58 assume !(0 != main_~p1~0); 1268#L58-2 assume !(0 != main_~p2~0); 1246#L62-1 assume !(0 != main_~p3~0); 1247#L66-1 assume !(0 != main_~p4~0); 1335#L70-1 assume !(0 != main_~p5~0); 1330#L74-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1331#L78-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1322#L82-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1323#L86-1 assume !(0 != main_~p1~0); 1359#L92-1 assume !(0 != main_~p2~0); 1357#L97-1 assume !(0 != main_~p3~0); 1355#L102-1 assume !(0 != main_~p4~0); 1354#L107-1 assume !(0 != main_~p5~0); 1352#L112-1 assume !(0 != main_~p6~0); 1351#L117-1 assume !(0 != main_~p7~0); 1287#L122-1 assume !(0 != main_~p8~0); 1170#L127-1 [2021-10-21 20:18:03,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:18:03,474 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-10-21 20:18:03,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:18:03,475 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915732162] [2021-10-21 20:18:03,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:18:03,475 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:18:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:18:03,487 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 20:18:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:18:03,502 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 20:18:03,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:18:03,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1530875096, now seen corresponding path program 1 times [2021-10-21 20:18:03,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:18:03,503 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061546198] [2021-10-21 20:18:03,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:18:03,504 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:18:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:18:03,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:18:03,529 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:18:03,529 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061546198] [2021-10-21 20:18:03,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061546198] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:18:03,530 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:18:03,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:18:03,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117280464] [2021-10-21 20:18:03,531 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-21 20:18:03,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:18:03,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:18:03,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:18:03,532 INFO L87 Difference]: Start difference. First operand 386 states and 578 transitions. cyclomatic complexity: 208 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10-21 20:18:03,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:18:03,550 INFO L93 Difference]: Finished difference Result 754 states and 1106 transitions. [2021-10-21 20:18:03,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:18:03,551 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 754 states and 1106 transitions. [2021-10-21 20:18:03,563 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 752 [2021-10-21 20:18:03,572 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 754 states to 754 states and 1106 transitions. [2021-10-21 20:18:03,573 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 754 [2021-10-21 20:18:03,574 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 754 [2021-10-21 20:18:03,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 754 states and 1106 transitions. [2021-10-21 20:18:03,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:18:03,579 INFO L681 BuchiCegarLoop]: Abstraction has 754 states and 1106 transitions. [2021-10-21 20:18:03,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states and 1106 transitions. [2021-10-21 20:18:03,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2021-10-21 20:18:03,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 754 states have (on average 1.46684350132626) internal successors, (1106), 753 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:18:03,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1106 transitions. [2021-10-21 20:18:03,610 INFO L704 BuchiCegarLoop]: Abstraction has 754 states and 1106 transitions. [2021-10-21 20:18:03,610 INFO L587 BuchiCegarLoop]: Abstraction has 754 states and 1106 transitions. [2021-10-21 20:18:03,610 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-10-21 20:18:03,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 754 states and 1106 transitions. [2021-10-21 20:18:03,616 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 752 [2021-10-21 20:18:03,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 20:18:03,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 20:18:03,617 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-21 20:18:03,618 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:18:03,618 INFO L791 eck$LassoCheckResult]: Stem: 2329#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 2315#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_~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_~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;havoc main_~cond~0; 2316#L127-1 [2021-10-21 20:18:03,618 INFO L793 eck$LassoCheckResult]: Loop: 2316#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 2415#L37 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; 2411#L58 assume !(0 != main_~p1~0); 2408#L58-2 assume !(0 != main_~p2~0); 2406#L62-1 assume !(0 != main_~p3~0); 2403#L66-1 assume !(0 != main_~p4~0); 2399#L70-1 assume !(0 != main_~p5~0); 2396#L74-1 assume !(0 != main_~p6~0); 2394#L78-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2391#L82-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2387#L86-1 assume !(0 != main_~p1~0); 2385#L92-1 assume !(0 != main_~p2~0); 2381#L97-1 assume !(0 != main_~p3~0); 2378#L102-1 assume !(0 != main_~p4~0); 2379#L107-1 assume !(0 != main_~p5~0); 2426#L112-1 assume !(0 != main_~p6~0); 2423#L117-1 assume !(0 != main_~p7~0); 2420#L122-1 assume !(0 != main_~p8~0); 2316#L127-1 [2021-10-21 20:18:03,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:18:03,619 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-10-21 20:18:03,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:18:03,619 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949053506] [2021-10-21 20:18:03,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:18:03,620 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:18:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:18:03,630 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 20:18:03,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:18:03,642 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 20:18:03,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:18:03,643 INFO L82 PathProgramCache]: Analyzing trace with hash -829810518, now seen corresponding path program 1 times [2021-10-21 20:18:03,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:18:03,644 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295885005] [2021-10-21 20:18:03,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:18:03,644 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:18:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:18:03,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:18:03,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:18:03,670 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295885005] [2021-10-21 20:18:03,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295885005] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:18:03,671 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:18:03,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:18:03,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394704742] [2021-10-21 20:18:03,672 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-21 20:18:03,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:18:03,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:18:03,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:18:03,673 INFO L87 Difference]: Start difference. First operand 754 states and 1106 transitions. cyclomatic complexity: 384 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10-21 20:18:03,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:18:03,698 INFO L93 Difference]: Finished difference Result 1474 states and 2114 transitions. [2021-10-21 20:18:03,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:18:03,699 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1474 states and 2114 transitions. [2021-10-21 20:18:03,748 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1472 [2021-10-21 20:18:03,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1474 states to 1474 states and 2114 transitions. [2021-10-21 20:18:03,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1474 [2021-10-21 20:18:03,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1474 [2021-10-21 20:18:03,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1474 states and 2114 transitions. [2021-10-21 20:18:03,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:18:03,778 INFO L681 BuchiCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2021-10-21 20:18:03,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states and 2114 transitions. [2021-10-21 20:18:03,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1474. [2021-10-21 20:18:03,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1474 states have (on average 1.4341926729986432) internal successors, (2114), 1473 states have internal predecessors, (2114), 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-10-21 20:18:03,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2114 transitions. [2021-10-21 20:18:03,822 INFO L704 BuchiCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2021-10-21 20:18:03,822 INFO L587 BuchiCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2021-10-21 20:18:03,823 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-10-21 20:18:03,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1474 states and 2114 transitions. [2021-10-21 20:18:03,834 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1472 [2021-10-21 20:18:03,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 20:18:03,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 20:18:03,834 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-21 20:18:03,835 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:18:03,835 INFO L791 eck$LassoCheckResult]: Stem: 4564#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 4550#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_~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_~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;havoc main_~cond~0; 4551#L127-1 [2021-10-21 20:18:03,835 INFO L793 eck$LassoCheckResult]: Loop: 4551#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 4806#L37 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; 4807#L58 assume !(0 != main_~p1~0); 4818#L58-2 assume !(0 != main_~p2~0); 4816#L62-1 assume !(0 != main_~p3~0); 4812#L66-1 assume !(0 != main_~p4~0); 4809#L70-1 assume !(0 != main_~p5~0); 4770#L74-1 assume !(0 != main_~p6~0); 4767#L78-1 assume !(0 != main_~p7~0); 4765#L82-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 4730#L86-1 assume !(0 != main_~p1~0); 4724#L92-1 assume !(0 != main_~p2~0); 4725#L97-1 assume !(0 != main_~p3~0); 4711#L102-1 assume !(0 != main_~p4~0); 4713#L107-1 assume !(0 != main_~p5~0); 4831#L112-1 assume !(0 != main_~p6~0); 4827#L117-1 assume !(0 != main_~p7~0); 4824#L122-1 assume !(0 != main_~p8~0); 4551#L127-1 [2021-10-21 20:18:03,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:18:03,836 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-10-21 20:18:03,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:18:03,836 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612444939] [2021-10-21 20:18:03,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:18:03,837 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:18:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:18:03,846 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 20:18:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:18:03,857 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 20:18:03,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:18:03,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1222837528, now seen corresponding path program 1 times [2021-10-21 20:18:03,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:18:03,859 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122107114] [2021-10-21 20:18:03,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:18:03,859 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:18:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:18:03,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:18:03,881 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:18:03,882 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122107114] [2021-10-21 20:18:03,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122107114] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:18:03,882 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:18:03,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-21 20:18:03,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766753422] [2021-10-21 20:18:03,883 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-21 20:18:03,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:18:03,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:18:03,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:18:03,885 INFO L87 Difference]: Start difference. First operand 1474 states and 2114 transitions. cyclomatic complexity: 704 Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10-21 20:18:03,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:18:03,950 INFO L93 Difference]: Finished difference Result 2882 states and 4034 transitions. [2021-10-21 20:18:03,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:18:03,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2882 states and 4034 transitions. [2021-10-21 20:18:03,988 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 2880 [2021-10-21 20:18:04,020 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2882 states to 2882 states and 4034 transitions. [2021-10-21 20:18:04,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2882 [2021-10-21 20:18:04,024 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2882 [2021-10-21 20:18:04,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2882 states and 4034 transitions. [2021-10-21 20:18:04,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 20:18:04,030 INFO L681 BuchiCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2021-10-21 20:18:04,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states and 4034 transitions. [2021-10-21 20:18:04,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2882. [2021-10-21 20:18:04,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2882 states, 2882 states have (on average 1.3997224149895906) internal successors, (4034), 2881 states have internal predecessors, (4034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:18:04,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2882 states and 4034 transitions. [2021-10-21 20:18:04,131 INFO L704 BuchiCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2021-10-21 20:18:04,131 INFO L587 BuchiCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2021-10-21 20:18:04,131 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-10-21 20:18:04,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2882 states and 4034 transitions. [2021-10-21 20:18:04,154 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 2880 [2021-10-21 20:18:04,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 20:18:04,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 20:18:04,155 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-21 20:18:04,155 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:18:04,155 INFO L791 eck$LassoCheckResult]: Stem: 8925#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(15);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 8910#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_~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_~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;havoc main_~cond~0; 8911#L127-1 [2021-10-21 20:18:04,156 INFO L793 eck$LassoCheckResult]: Loop: 8911#L127-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 9035#L37 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; 9033#L58 assume !(0 != main_~p1~0); 9027#L58-2 assume !(0 != main_~p2~0); 9029#L62-1 assume !(0 != main_~p3~0); 9017#L66-1 assume !(0 != main_~p4~0); 9019#L70-1 assume !(0 != main_~p5~0); 9005#L74-1 assume !(0 != main_~p6~0); 9007#L78-1 assume !(0 != main_~p7~0); 8993#L82-1 assume !(0 != main_~p8~0); 8995#L86-1 assume !(0 != main_~p1~0); 9058#L92-1 assume !(0 != main_~p2~0); 9056#L97-1 assume !(0 != main_~p3~0); 9053#L102-1 assume !(0 != main_~p4~0); 9051#L107-1 assume !(0 != main_~p5~0); 9047#L112-1 assume !(0 != main_~p6~0); 9043#L117-1 assume !(0 != main_~p7~0); 9039#L122-1 assume !(0 != main_~p8~0); 8911#L127-1 [2021-10-21 20:18:04,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:18:04,156 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-10-21 20:18:04,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:18:04,157 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275574818] [2021-10-21 20:18:04,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:18:04,158 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:18:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:18:04,174 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 20:18:04,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:18:04,204 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 20:18:04,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:18:04,211 INFO L82 PathProgramCache]: Analyzing trace with hash -542779158, now seen corresponding path program 1 times [2021-10-21 20:18:04,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:18:04,211 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720060406] [2021-10-21 20:18:04,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:18:04,212 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:18:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:18:04,220 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 20:18:04,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:18:04,232 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 20:18:04,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:18:04,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1175900116, now seen corresponding path program 1 times [2021-10-21 20:18:04,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:18:04,241 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430620979] [2021-10-21 20:18:04,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:18:04,243 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:18:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:18:04,266 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 20:18:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:18:04,281 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 20:18:05,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.10 08:18:05 BoogieIcfgContainer [2021-10-21 20:18:05,056 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-10-21 20:18:05,057 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-21 20:18:05,057 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-21 20:18:05,057 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-21 20:18:05,058 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 08:18:02" (3/4) ... [2021-10-21 20:18:05,061 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-10-21 20:18:05,128 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6719e03a-03b1-4170-ad8c-38ccf3b1ef67/bin/uautomizer-j4sWxH34Be/witness.graphml [2021-10-21 20:18:05,128 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-21 20:18:05,134 INFO L168 Benchmark]: Toolchain (without parser) took 3741.72 ms. Allocated memory was 119.5 MB in the beginning and 155.2 MB in the end (delta: 35.7 MB). Free memory was 79.9 MB in the beginning and 58.3 MB in the end (delta: 21.5 MB). Peak memory consumption was 57.3 MB. Max. memory is 16.1 GB. [2021-10-21 20:18:05,135 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 119.5 MB. Free memory was 96.3 MB in the beginning and 96.2 MB in the end (delta: 56.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 20:18:05,135 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.61 ms. Allocated memory is still 119.5 MB. Free memory was 79.6 MB in the beginning and 93.8 MB in the end (delta: -14.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-21 20:18:05,136 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.17 ms. Allocated memory is still 119.5 MB. Free memory was 93.8 MB in the beginning and 92.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 20:18:05,137 INFO L168 Benchmark]: Boogie Preprocessor took 36.43 ms. Allocated memory is still 119.5 MB. Free memory was 92.1 MB in the beginning and 90.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 20:18:05,137 INFO L168 Benchmark]: RCFGBuilder took 377.61 ms. Allocated memory is still 119.5 MB. Free memory was 90.9 MB in the beginning and 80.0 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-21 20:18:05,138 INFO L168 Benchmark]: BuchiAutomizer took 2888.67 ms. Allocated memory was 119.5 MB in the beginning and 155.2 MB in the end (delta: 35.7 MB). Free memory was 79.7 MB in the beginning and 60.4 MB in the end (delta: 19.2 MB). Peak memory consumption was 57.5 MB. Max. memory is 16.1 GB. [2021-10-21 20:18:05,138 INFO L168 Benchmark]: Witness Printer took 71.57 ms. Allocated memory is still 155.2 MB. Free memory was 60.4 MB in the beginning and 58.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 20:18:05,142 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.31 ms. Allocated memory is still 119.5 MB. Free memory was 96.3 MB in the beginning and 96.2 MB in the end (delta: 56.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 319.61 ms. Allocated memory is still 119.5 MB. Free memory was 79.6 MB in the beginning and 93.8 MB in the end (delta: -14.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 41.17 ms. Allocated memory is still 119.5 MB. Free memory was 93.8 MB in the beginning and 92.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 36.43 ms. Allocated memory is still 119.5 MB. Free memory was 92.1 MB in the beginning and 90.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 377.61 ms. Allocated memory is still 119.5 MB. Free memory was 90.9 MB in the beginning and 80.0 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 2888.67 ms. Allocated memory was 119.5 MB in the beginning and 155.2 MB in the end (delta: 35.7 MB). Free memory was 79.7 MB in the beginning and 60.4 MB in the end (delta: 19.2 MB). Peak memory consumption was 57.5 MB. Max. memory is 16.1 GB. * Witness Printer took 71.57 ms. Allocated memory is still 155.2 MB. Free memory was 60.4 MB in the beginning and 58.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 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 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 2882 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 275.9ms AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 2882 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 459 SDtfs, 236 SDslu, 277 SDs, 0 SdLazy, 35 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 85.4ms Time LassoAnalysisResults: nont1 unkn0 SFLI7 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: 35]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=8573} State at position 1 is {NULL=8574, NULL=0, p1=0, \result=0, p3=0, p2=0, p5=0, NULL=8573, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@72326c1a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1390927e=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2bd458f4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6c9744f1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@da4a7c5=0, cond=10, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1a30c76d=0, NULL=8576, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@132a3f27=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@454c517f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6dfe4c9c=10, NULL=0, NULL=0, NULL=0, NULL=8575, lk3=0, lk4=0, lk5=0, lk6=0, NULL=0, lk1=0, lk2=0, lk7=0, lk8=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 35]: 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; [L33] int cond; Loop: [L35] COND TRUE 1 [L36] cond = __VERIFIER_nondet_int() [L37] COND FALSE !(cond == 0) [L40] lk1 = 0 [L42] lk2 = 0 [L44] lk3 = 0 [L46] lk4 = 0 [L48] lk5 = 0 [L50] lk6 = 0 [L52] lk7 = 0 [L54] lk8 = 0 [L58] COND FALSE !(p1 != 0) [L62] COND FALSE !(p2 != 0) [L66] COND FALSE !(p3 != 0) [L70] COND FALSE !(p4 != 0) [L74] COND FALSE !(p5 != 0) [L78] COND FALSE !(p6 != 0) [L82] COND FALSE !(p7 != 0) [L86] COND FALSE !(p8 != 0) [L92] COND FALSE !(p1 != 0) [L97] COND FALSE !(p2 != 0) [L102] COND FALSE !(p3 != 0) [L107] COND FALSE !(p4 != 0) [L112] COND FALSE !(p5 != 0) [L117] COND FALSE !(p6 != 0) [L122] COND FALSE !(p7 != 0) [L127] COND FALSE !(p8 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-10-21 20:18:05,246 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6719e03a-03b1-4170-ad8c-38ccf3b1ef67/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...