./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_9.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ae9e92e-157f-47f6-8395-0e8ec0efb9c5/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ae9e92e-157f-47f6-8395-0e8ec0efb9c5/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ae9e92e-157f-47f6-8395-0e8ec0efb9c5/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ae9e92e-157f-47f6-8395-0e8ec0efb9c5/bin/uautomizer-uyxdKDjOR8/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_9.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ae9e92e-157f-47f6-8395-0e8ec0efb9c5/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ae9e92e-157f-47f6-8395-0e8ec0efb9c5/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 19:54:30,877 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 19:54:30,879 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 19:54:30,899 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 19:54:30,899 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 19:54:30,900 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 19:54:30,901 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 19:54:30,903 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 19:54:30,904 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 19:54:30,905 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 19:54:30,906 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 19:54:30,907 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 19:54:30,907 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 19:54:30,908 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 19:54:30,909 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 19:54:30,910 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 19:54:30,911 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 19:54:30,912 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 19:54:30,914 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 19:54:30,915 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 19:54:30,917 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 19:54:30,918 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 19:54:30,919 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 19:54:30,920 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 19:54:30,924 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 19:54:30,924 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 19:54:30,924 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 19:54:30,925 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 19:54:30,926 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 19:54:30,927 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 19:54:30,927 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 19:54:30,928 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 19:54:30,929 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 19:54:30,929 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 19:54:30,930 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 19:54:30,931 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 19:54:30,931 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 19:54:30,932 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 19:54:30,932 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 19:54:30,933 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 19:54:30,933 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 19:54:30,935 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ae9e92e-157f-47f6-8395-0e8ec0efb9c5/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-12-13 19:54:30,957 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 19:54:30,957 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 19:54:30,958 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 19:54:30,958 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 19:54:30,959 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 19:54:30,959 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 19:54:30,959 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 19:54:30,959 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-12-13 19:54:30,959 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-12-13 19:54:30,960 INFO L138 SettingsManager]: * Use old map elimination=false [2022-12-13 19:54:30,960 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-12-13 19:54:30,960 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-12-13 19:54:30,960 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-12-13 19:54:30,960 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 19:54:30,960 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 19:54:30,961 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 19:54:30,961 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 19:54:30,961 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 19:54:30,970 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 19:54:30,970 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-12-13 19:54:30,970 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-12-13 19:54:30,970 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-12-13 19:54:30,970 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 19:54:30,970 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 19:54:30,971 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-12-13 19:54:30,971 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 19:54:30,971 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-12-13 19:54:30,971 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 19:54:30,971 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 19:54:30,972 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 19:54:30,972 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 19:54:30,973 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-12-13 19:54:30,973 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_8ae9e92e-157f-47f6-8395-0e8ec0efb9c5/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ae9e92e-157f-47f6-8395-0e8ec0efb9c5/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 [2022-12-13 19:54:31,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 19:54:31,187 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 19:54:31,189 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 19:54:31,190 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 19:54:31,191 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 19:54:31,192 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ae9e92e-157f-47f6-8395-0e8ec0efb9c5/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/locks/test_locks_9.c [2022-12-13 19:54:33,822 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 19:54:33,960 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 19:54:33,961 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ae9e92e-157f-47f6-8395-0e8ec0efb9c5/sv-benchmarks/c/locks/test_locks_9.c [2022-12-13 19:54:33,967 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ae9e92e-157f-47f6-8395-0e8ec0efb9c5/bin/uautomizer-uyxdKDjOR8/data/0373a872c/9cfe58dfb07648c0a731f7429fc05073/FLAGdb358a4c8 [2022-12-13 19:54:33,980 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ae9e92e-157f-47f6-8395-0e8ec0efb9c5/bin/uautomizer-uyxdKDjOR8/data/0373a872c/9cfe58dfb07648c0a731f7429fc05073 [2022-12-13 19:54:33,982 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 19:54:33,983 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 19:54:33,985 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 19:54:33,985 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 19:54:33,988 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 19:54:33,989 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:54:33" (1/1) ... [2022-12-13 19:54:33,990 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@adf3ffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:54:33, skipping insertion in model container [2022-12-13 19:54:33,990 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:54:33" (1/1) ... [2022-12-13 19:54:33,997 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 19:54:34,014 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 19:54:34,144 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ae9e92e-157f-47f6-8395-0e8ec0efb9c5/sv-benchmarks/c/locks/test_locks_9.c[3555,3568] [2022-12-13 19:54:34,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:54:34,153 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 19:54:34,167 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ae9e92e-157f-47f6-8395-0e8ec0efb9c5/sv-benchmarks/c/locks/test_locks_9.c[3555,3568] [2022-12-13 19:54:34,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:54:34,177 INFO L208 MainTranslator]: Completed translation [2022-12-13 19:54:34,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:54:34 WrapperNode [2022-12-13 19:54:34,178 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 19:54:34,178 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 19:54:34,179 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 19:54:34,179 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 19:54:34,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:54:34" (1/1) ... [2022-12-13 19:54:34,188 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:54:34" (1/1) ... [2022-12-13 19:54:34,201 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 117 [2022-12-13 19:54:34,201 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 19:54:34,201 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 19:54:34,201 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 19:54:34,201 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 19:54:34,207 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:54:34" (1/1) ... [2022-12-13 19:54:34,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:54:34" (1/1) ... [2022-12-13 19:54:34,208 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:54:34" (1/1) ... [2022-12-13 19:54:34,209 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:54:34" (1/1) ... [2022-12-13 19:54:34,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:54:34" (1/1) ... [2022-12-13 19:54:34,213 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:54:34" (1/1) ... [2022-12-13 19:54:34,214 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:54:34" (1/1) ... [2022-12-13 19:54:34,215 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:54:34" (1/1) ... [2022-12-13 19:54:34,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 19:54:34,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 19:54:34,217 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 19:54:34,217 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 19:54:34,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:54:34" (1/1) ... [2022-12-13 19:54:34,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 19:54:34,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ae9e92e-157f-47f6-8395-0e8ec0efb9c5/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:54:34,241 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ae9e92e-157f-47f6-8395-0e8ec0efb9c5/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 19:54:34,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ae9e92e-157f-47f6-8395-0e8ec0efb9c5/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-12-13 19:54:34,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 19:54:34,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 19:54:34,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 19:54:34,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 19:54:34,339 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 19:54:34,341 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 19:54:34,469 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 19:54:34,473 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 19:54:34,473 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 19:54:34,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:54:34 BoogieIcfgContainer [2022-12-13 19:54:34,475 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 19:54:34,476 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-12-13 19:54:34,476 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-12-13 19:54:34,478 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-12-13 19:54:34,479 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 19:54:34,479 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.12 07:54:33" (1/3) ... [2022-12-13 19:54:34,479 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@299301b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 07:54:34, skipping insertion in model container [2022-12-13 19:54:34,480 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 19:54:34,480 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:54:34" (2/3) ... [2022-12-13 19:54:34,480 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@299301b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 07:54:34, skipping insertion in model container [2022-12-13 19:54:34,480 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 19:54:34,480 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:54:34" (3/3) ... [2022-12-13 19:54:34,481 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_9.c [2022-12-13 19:54:34,526 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-12-13 19:54:34,526 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-12-13 19:54:34,526 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-12-13 19:54:34,527 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-12-13 19:54:34,527 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-12-13 19:54:34,527 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-12-13 19:54:34,527 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-12-13 19:54:34,527 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-12-13 19:54:34,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 36 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 35 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:54:34,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2022-12-13 19:54:34,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 19:54:34,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 19:54:34,558 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 19:54:34,558 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:54:34,558 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-12-13 19:54:34,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 36 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 35 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:54:34,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2022-12-13 19:54:34,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 19:54:34,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 19:54:34,562 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 19:54:34,562 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:54:34,569 INFO L748 eck$LassoCheckResult]: Stem: 31#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; 12#L141-1true [2022-12-13 19:54:34,570 INFO L750 eck$LassoCheckResult]: Loop: 12#L141-1true assume !false;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 35#L40true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; 3#L63true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 19#L63-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 26#L67-1true assume !(0 != main_~p3~0#1); 23#L71-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 28#L75-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 14#L79-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 36#L83-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 8#L87-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4#L91-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 33#L95-1true assume !(0 != main_~p1~0#1); 21#L101-1true assume !(0 != main_~p2~0#1); 9#L106-1true assume !(0 != main_~p3~0#1); 10#L111-1true assume !(0 != main_~p4~0#1); 32#L116-1true assume !(0 != main_~p5~0#1); 5#L121-1true assume !(0 != main_~p6~0#1); 17#L126-1true assume !(0 != main_~p7~0#1); 29#L131-1true assume !(0 != main_~p8~0#1); 18#L136-1true assume !(0 != main_~p9~0#1); 12#L141-1true [2022-12-13 19:54:34,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:54:34,574 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-12-13 19:54:34,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:54:34,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809166330] [2022-12-13 19:54:34,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:54:34,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:54:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:54:34,642 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:54:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:54:34,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 19:54:34,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:54:34,664 INFO L85 PathProgramCache]: Analyzing trace with hash 694706197, now seen corresponding path program 1 times [2022-12-13 19:54:34,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:54:34,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883087406] [2022-12-13 19:54:34,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:54:34,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:54:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:54:34,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:54:34,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:54:34,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883087406] [2022-12-13 19:54:34,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883087406] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:54:34,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:54:34,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:54:34,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609476978] [2022-12-13 19:54:34,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:54:34,741 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 19:54:34,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:54:34,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:54:34,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:54:34,768 INFO L87 Difference]: Start difference. First operand has 36 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 35 states have internal predecessors, (65), 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.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:54:34,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:54:34,796 INFO L93 Difference]: Finished difference Result 69 states and 118 transitions. [2022-12-13 19:54:34,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 118 transitions. [2022-12-13 19:54:34,799 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2022-12-13 19:54:34,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 59 states and 93 transitions. [2022-12-13 19:54:34,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2022-12-13 19:54:34,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2022-12-13 19:54:34,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 93 transitions. [2022-12-13 19:54:34,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:54:34,803 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 93 transitions. [2022-12-13 19:54:34,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 93 transitions. [2022-12-13 19:54:34,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-12-13 19:54:34,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.576271186440678) internal successors, (93), 58 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:54:34,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 93 transitions. [2022-12-13 19:54:34,825 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 93 transitions. [2022-12-13 19:54:34,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:54:34,828 INFO L428 stractBuchiCegarLoop]: Abstraction has 59 states and 93 transitions. [2022-12-13 19:54:34,829 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-12-13 19:54:34,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 93 transitions. [2022-12-13 19:54:34,830 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2022-12-13 19:54:34,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 19:54:34,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 19:54:34,830 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 19:54:34,830 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:54:34,830 INFO L748 eck$LassoCheckResult]: Stem: 148#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 123#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; 124#L141-1 [2022-12-13 19:54:34,830 INFO L750 eck$LassoCheckResult]: Loop: 124#L141-1 assume !false;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 131#L40 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; 150#L63 assume !(0 != main_~p1~0#1); 139#L63-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 140#L67-1 assume !(0 != main_~p3~0#1); 145#L71-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 146#L75-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 132#L79-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 133#L83-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 125#L87-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 116#L91-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 117#L95-1 assume !(0 != main_~p1~0#1); 141#L101-1 assume !(0 != main_~p2~0#1); 126#L106-1 assume !(0 != main_~p3~0#1); 127#L111-1 assume !(0 != main_~p4~0#1); 122#L116-1 assume !(0 != main_~p5~0#1); 118#L121-1 assume !(0 != main_~p6~0#1); 120#L126-1 assume !(0 != main_~p7~0#1); 135#L131-1 assume !(0 != main_~p8~0#1); 137#L136-1 assume !(0 != main_~p9~0#1); 124#L141-1 [2022-12-13 19:54:34,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:54:34,831 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-12-13 19:54:34,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:54:34,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818777783] [2022-12-13 19:54:34,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:54:34,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:54:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:54:34,837 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:54:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:54:34,842 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 19:54:34,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:54:34,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1299438509, now seen corresponding path program 1 times [2022-12-13 19:54:34,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:54:34,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579031837] [2022-12-13 19:54:34,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:54:34,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:54:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:54:34,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:54:34,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:54:34,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579031837] [2022-12-13 19:54:34,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579031837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:54:34,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:54:34,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:54:34,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973979161] [2022-12-13 19:54:34,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:54:34,877 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 19:54:34,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:54:34,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:54:34,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:54:34,878 INFO L87 Difference]: Start difference. First operand 59 states and 93 transitions. cyclomatic complexity: 36 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:54:34,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:54:34,894 INFO L93 Difference]: Finished difference Result 114 states and 178 transitions. [2022-12-13 19:54:34,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 178 transitions. [2022-12-13 19:54:34,897 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 112 [2022-12-13 19:54:34,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 114 states and 178 transitions. [2022-12-13 19:54:34,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 114 [2022-12-13 19:54:34,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2022-12-13 19:54:34,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 178 transitions. [2022-12-13 19:54:34,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:54:34,899 INFO L218 hiAutomatonCegarLoop]: Abstraction has 114 states and 178 transitions. [2022-12-13 19:54:34,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 178 transitions. [2022-12-13 19:54:34,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-12-13 19:54:34,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 114 states have (on average 1.5614035087719298) internal successors, (178), 113 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:54:34,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 178 transitions. [2022-12-13 19:54:34,905 INFO L240 hiAutomatonCegarLoop]: Abstraction has 114 states and 178 transitions. [2022-12-13 19:54:34,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:54:34,906 INFO L428 stractBuchiCegarLoop]: Abstraction has 114 states and 178 transitions. [2022-12-13 19:54:34,906 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-12-13 19:54:34,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 178 transitions. [2022-12-13 19:54:34,907 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 112 [2022-12-13 19:54:34,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 19:54:34,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 19:54:34,907 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 19:54:34,907 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:54:34,907 INFO L748 eck$LassoCheckResult]: Stem: 326#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 302#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; 303#L141-1 [2022-12-13 19:54:34,907 INFO L750 eck$LassoCheckResult]: Loop: 303#L141-1 assume !false;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 337#L40 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; 334#L63 assume !(0 != main_~p1~0#1); 335#L63-2 assume !(0 != main_~p2~0#1); 377#L67-1 assume !(0 != main_~p3~0#1); 376#L71-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 375#L75-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 374#L79-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 373#L83-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 372#L87-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 371#L91-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 370#L95-1 assume !(0 != main_~p1~0#1); 368#L101-1 assume !(0 != main_~p2~0#1); 366#L106-1 assume !(0 != main_~p3~0#1); 361#L111-1 assume !(0 != main_~p4~0#1); 358#L116-1 assume !(0 != main_~p5~0#1); 354#L121-1 assume !(0 != main_~p6~0#1); 350#L126-1 assume !(0 != main_~p7~0#1); 346#L131-1 assume !(0 != main_~p8~0#1); 342#L136-1 assume !(0 != main_~p9~0#1); 303#L141-1 [2022-12-13 19:54:34,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:54:34,908 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-12-13 19:54:34,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:54:34,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968143466] [2022-12-13 19:54:34,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:54:34,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:54:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:54:34,913 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:54:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:54:34,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 19:54:34,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:54:34,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1407180885, now seen corresponding path program 1 times [2022-12-13 19:54:34,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:54:34,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44520298] [2022-12-13 19:54:34,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:54:34,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:54:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:54:34,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:54:34,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:54:34,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44520298] [2022-12-13 19:54:34,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44520298] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:54:34,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:54:34,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:54:34,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019007203] [2022-12-13 19:54:34,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:54:34,948 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 19:54:34,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:54:34,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:54:34,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:54:34,949 INFO L87 Difference]: Start difference. First operand 114 states and 178 transitions. cyclomatic complexity: 68 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:54:34,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:54:34,966 INFO L93 Difference]: Finished difference Result 222 states and 342 transitions. [2022-12-13 19:54:34,966 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 342 transitions. [2022-12-13 19:54:34,969 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 220 [2022-12-13 19:54:34,970 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 222 states and 342 transitions. [2022-12-13 19:54:34,971 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 222 [2022-12-13 19:54:34,971 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 222 [2022-12-13 19:54:34,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 222 states and 342 transitions. [2022-12-13 19:54:34,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:54:34,972 INFO L218 hiAutomatonCegarLoop]: Abstraction has 222 states and 342 transitions. [2022-12-13 19:54:34,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states and 342 transitions. [2022-12-13 19:54:34,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-12-13 19:54:34,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 222 states have (on average 1.5405405405405406) internal successors, (342), 221 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:54:34,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 342 transitions. [2022-12-13 19:54:34,981 INFO L240 hiAutomatonCegarLoop]: Abstraction has 222 states and 342 transitions. [2022-12-13 19:54:34,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:54:34,982 INFO L428 stractBuchiCegarLoop]: Abstraction has 222 states and 342 transitions. [2022-12-13 19:54:34,982 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-12-13 19:54:34,982 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 222 states and 342 transitions. [2022-12-13 19:54:34,983 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 220 [2022-12-13 19:54:34,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 19:54:34,984 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 19:54:34,984 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 19:54:34,984 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:54:34,984 INFO L748 eck$LassoCheckResult]: Stem: 672#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 644#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; 645#L141-1 [2022-12-13 19:54:34,984 INFO L750 eck$LassoCheckResult]: Loop: 645#L141-1 assume !false;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 710#L40 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; 707#L63 assume !(0 != main_~p1~0#1); 704#L63-2 assume !(0 != main_~p2~0#1); 701#L67-1 assume !(0 != main_~p3~0#1); 698#L71-1 assume !(0 != main_~p4~0#1); 696#L75-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 694#L79-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 692#L83-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 690#L87-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 688#L91-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 685#L95-1 assume !(0 != main_~p1~0#1); 686#L101-1 assume !(0 != main_~p2~0#1); 735#L106-1 assume !(0 != main_~p3~0#1); 730#L111-1 assume !(0 != main_~p4~0#1); 729#L116-1 assume !(0 != main_~p5~0#1); 725#L121-1 assume !(0 != main_~p6~0#1); 721#L126-1 assume !(0 != main_~p7~0#1); 717#L131-1 assume !(0 != main_~p8~0#1); 714#L136-1 assume !(0 != main_~p9~0#1); 645#L141-1 [2022-12-13 19:54:34,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:54:34,985 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-12-13 19:54:34,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:54:34,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826746405] [2022-12-13 19:54:34,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:54:34,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:54:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:54:34,989 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:54:34,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:54:34,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 19:54:34,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:54:34,994 INFO L85 PathProgramCache]: Analyzing trace with hash 127317207, now seen corresponding path program 1 times [2022-12-13 19:54:34,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:54:34,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373883323] [2022-12-13 19:54:34,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:54:34,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:54:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:54:35,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:54:35,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:54:35,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373883323] [2022-12-13 19:54:35,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373883323] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:54:35,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:54:35,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:54:35,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009140833] [2022-12-13 19:54:35,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:54:35,022 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 19:54:35,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:54:35,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:54:35,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:54:35,023 INFO L87 Difference]: Start difference. First operand 222 states and 342 transitions. cyclomatic complexity: 128 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:54:35,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:54:35,039 INFO L93 Difference]: Finished difference Result 434 states and 658 transitions. [2022-12-13 19:54:35,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 434 states and 658 transitions. [2022-12-13 19:54:35,042 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 432 [2022-12-13 19:54:35,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 434 states to 434 states and 658 transitions. [2022-12-13 19:54:35,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 434 [2022-12-13 19:54:35,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 434 [2022-12-13 19:54:35,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 434 states and 658 transitions. [2022-12-13 19:54:35,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:54:35,048 INFO L218 hiAutomatonCegarLoop]: Abstraction has 434 states and 658 transitions. [2022-12-13 19:54:35,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states and 658 transitions. [2022-12-13 19:54:35,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2022-12-13 19:54:35,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 434 states have (on average 1.5161290322580645) internal successors, (658), 433 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:54:35,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 658 transitions. [2022-12-13 19:54:35,067 INFO L240 hiAutomatonCegarLoop]: Abstraction has 434 states and 658 transitions. [2022-12-13 19:54:35,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:54:35,068 INFO L428 stractBuchiCegarLoop]: Abstraction has 434 states and 658 transitions. [2022-12-13 19:54:35,068 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-12-13 19:54:35,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 434 states and 658 transitions. [2022-12-13 19:54:35,070 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 432 [2022-12-13 19:54:35,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 19:54:35,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 19:54:35,070 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 19:54:35,071 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:54:35,071 INFO L748 eck$LassoCheckResult]: Stem: 1334#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 1306#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; 1307#L141-1 [2022-12-13 19:54:35,071 INFO L750 eck$LassoCheckResult]: Loop: 1307#L141-1 assume !false;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 1386#L40 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; 1383#L63 assume !(0 != main_~p1~0#1); 1379#L63-2 assume !(0 != main_~p2~0#1); 1376#L67-1 assume !(0 != main_~p3~0#1); 1373#L71-1 assume !(0 != main_~p4~0#1); 1367#L75-1 assume !(0 != main_~p5~0#1); 1368#L79-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1358#L83-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1359#L87-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1351#L91-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1352#L95-1 assume !(0 != main_~p1~0#1); 1415#L101-1 assume !(0 != main_~p2~0#1); 1412#L106-1 assume !(0 != main_~p3~0#1); 1407#L111-1 assume !(0 != main_~p4~0#1); 1405#L116-1 assume !(0 != main_~p5~0#1); 1403#L121-1 assume !(0 != main_~p6~0#1); 1399#L126-1 assume !(0 != main_~p7~0#1); 1395#L131-1 assume !(0 != main_~p8~0#1); 1391#L136-1 assume !(0 != main_~p9~0#1); 1307#L141-1 [2022-12-13 19:54:35,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:54:35,078 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-12-13 19:54:35,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:54:35,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400675814] [2022-12-13 19:54:35,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:54:35,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:54:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:54:35,083 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:54:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:54:35,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 19:54:35,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:54:35,087 INFO L85 PathProgramCache]: Analyzing trace with hash -883800043, now seen corresponding path program 1 times [2022-12-13 19:54:35,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:54:35,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955668447] [2022-12-13 19:54:35,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:54:35,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:54:35,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:54:35,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:54:35,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:54:35,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955668447] [2022-12-13 19:54:35,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955668447] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:54:35,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:54:35,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:54:35,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509331925] [2022-12-13 19:54:35,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:54:35,116 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 19:54:35,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:54:35,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:54:35,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:54:35,116 INFO L87 Difference]: Start difference. First operand 434 states and 658 transitions. cyclomatic complexity: 240 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:54:35,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:54:35,130 INFO L93 Difference]: Finished difference Result 850 states and 1266 transitions. [2022-12-13 19:54:35,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 850 states and 1266 transitions. [2022-12-13 19:54:35,139 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 848 [2022-12-13 19:54:35,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 850 states to 850 states and 1266 transitions. [2022-12-13 19:54:35,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 850 [2022-12-13 19:54:35,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 850 [2022-12-13 19:54:35,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 850 states and 1266 transitions. [2022-12-13 19:54:35,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:54:35,150 INFO L218 hiAutomatonCegarLoop]: Abstraction has 850 states and 1266 transitions. [2022-12-13 19:54:35,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states and 1266 transitions. [2022-12-13 19:54:35,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 850. [2022-12-13 19:54:35,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 850 states have (on average 1.4894117647058824) internal successors, (1266), 849 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:54:35,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1266 transitions. [2022-12-13 19:54:35,180 INFO L240 hiAutomatonCegarLoop]: Abstraction has 850 states and 1266 transitions. [2022-12-13 19:54:35,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:54:35,181 INFO L428 stractBuchiCegarLoop]: Abstraction has 850 states and 1266 transitions. [2022-12-13 19:54:35,181 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-12-13 19:54:35,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 850 states and 1266 transitions. [2022-12-13 19:54:35,187 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 848 [2022-12-13 19:54:35,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 19:54:35,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 19:54:35,188 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 19:54:35,188 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:54:35,188 INFO L748 eck$LassoCheckResult]: Stem: 2628#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 2595#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; 2596#L141-1 [2022-12-13 19:54:35,189 INFO L750 eck$LassoCheckResult]: Loop: 2596#L141-1 assume !false;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 2794#L40 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; 2791#L63 assume !(0 != main_~p1~0#1); 2792#L63-2 assume !(0 != main_~p2~0#1); 2777#L67-1 assume !(0 != main_~p3~0#1); 2778#L71-1 assume !(0 != main_~p4~0#1); 2759#L75-1 assume !(0 != main_~p5~0#1); 2761#L79-1 assume !(0 != main_~p6~0#1); 2745#L83-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2746#L87-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2731#L91-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 2732#L95-1 assume !(0 != main_~p1~0#1); 2816#L101-1 assume !(0 != main_~p2~0#1); 2815#L106-1 assume !(0 != main_~p3~0#1); 2812#L111-1 assume !(0 != main_~p4~0#1); 2810#L116-1 assume !(0 != main_~p5~0#1); 2808#L121-1 assume !(0 != main_~p6~0#1); 2807#L126-1 assume !(0 != main_~p7~0#1); 2803#L131-1 assume !(0 != main_~p8~0#1); 2799#L136-1 assume !(0 != main_~p9~0#1); 2596#L141-1 [2022-12-13 19:54:35,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:54:35,189 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-12-13 19:54:35,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:54:35,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768900369] [2022-12-13 19:54:35,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:54:35,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:54:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:54:35,195 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:54:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:54:35,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 19:54:35,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:54:35,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1470606057, now seen corresponding path program 1 times [2022-12-13 19:54:35,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:54:35,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085221214] [2022-12-13 19:54:35,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:54:35,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:54:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:54:35,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:54:35,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:54:35,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085221214] [2022-12-13 19:54:35,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085221214] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:54:35,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:54:35,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:54:35,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784353630] [2022-12-13 19:54:35,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:54:35,233 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 19:54:35,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:54:35,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:54:35,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:54:35,234 INFO L87 Difference]: Start difference. First operand 850 states and 1266 transitions. cyclomatic complexity: 448 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:54:35,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:54:35,252 INFO L93 Difference]: Finished difference Result 1666 states and 2434 transitions. [2022-12-13 19:54:35,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1666 states and 2434 transitions. [2022-12-13 19:54:35,262 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1664 [2022-12-13 19:54:35,267 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1666 states to 1666 states and 2434 transitions. [2022-12-13 19:54:35,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1666 [2022-12-13 19:54:35,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1666 [2022-12-13 19:54:35,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1666 states and 2434 transitions. [2022-12-13 19:54:35,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:54:35,273 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1666 states and 2434 transitions. [2022-12-13 19:54:35,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states and 2434 transitions. [2022-12-13 19:54:35,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1666. [2022-12-13 19:54:35,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1666 states, 1666 states have (on average 1.460984393757503) internal successors, (2434), 1665 states have internal predecessors, (2434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:54:35,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 2434 transitions. [2022-12-13 19:54:35,311 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1666 states and 2434 transitions. [2022-12-13 19:54:35,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:54:35,312 INFO L428 stractBuchiCegarLoop]: Abstraction has 1666 states and 2434 transitions. [2022-12-13 19:54:35,312 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-12-13 19:54:35,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1666 states and 2434 transitions. [2022-12-13 19:54:35,320 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1664 [2022-12-13 19:54:35,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 19:54:35,320 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 19:54:35,321 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 19:54:35,321 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:54:35,321 INFO L748 eck$LassoCheckResult]: Stem: 5146#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 5117#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; 5118#L141-1 [2022-12-13 19:54:35,321 INFO L750 eck$LassoCheckResult]: Loop: 5118#L141-1 assume !false;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 5459#L40 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; 5457#L63 assume !(0 != main_~p1~0#1); 5455#L63-2 assume !(0 != main_~p2~0#1); 5453#L67-1 assume !(0 != main_~p3~0#1); 5450#L71-1 assume !(0 != main_~p4~0#1); 5447#L75-1 assume !(0 != main_~p5~0#1); 5444#L79-1 assume !(0 != main_~p6~0#1); 5440#L83-1 assume !(0 != main_~p7~0#1); 5438#L87-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 5436#L91-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 5434#L95-1 assume !(0 != main_~p1~0#1); 5428#L101-1 assume !(0 != main_~p2~0#1); 5429#L106-1 assume !(0 != main_~p3~0#1); 5414#L111-1 assume !(0 != main_~p4~0#1); 5415#L116-1 assume !(0 != main_~p5~0#1); 5466#L121-1 assume !(0 != main_~p6~0#1); 5464#L126-1 assume !(0 != main_~p7~0#1); 5463#L131-1 assume !(0 != main_~p8~0#1); 5461#L136-1 assume !(0 != main_~p9~0#1); 5118#L141-1 [2022-12-13 19:54:35,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:54:35,322 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2022-12-13 19:54:35,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:54:35,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886970130] [2022-12-13 19:54:35,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:54:35,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:54:35,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:54:35,327 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:54:35,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:54:35,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 19:54:35,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:54:35,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1212440619, now seen corresponding path program 1 times [2022-12-13 19:54:35,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:54:35,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047566153] [2022-12-13 19:54:35,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:54:35,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:54:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:54:35,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:54:35,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:54:35,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047566153] [2022-12-13 19:54:35,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047566153] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:54:35,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:54:35,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:54:35,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804402982] [2022-12-13 19:54:35,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:54:35,358 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 19:54:35,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:54:35,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:54:35,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:54:35,359 INFO L87 Difference]: Start difference. First operand 1666 states and 2434 transitions. cyclomatic complexity: 832 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:54:35,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:54:35,378 INFO L93 Difference]: Finished difference Result 3266 states and 4674 transitions. [2022-12-13 19:54:35,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3266 states and 4674 transitions. [2022-12-13 19:54:35,393 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3264 [2022-12-13 19:54:35,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3266 states to 3266 states and 4674 transitions. [2022-12-13 19:54:35,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3266 [2022-12-13 19:54:35,403 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3266 [2022-12-13 19:54:35,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3266 states and 4674 transitions. [2022-12-13 19:54:35,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:54:35,406 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3266 states and 4674 transitions. [2022-12-13 19:54:35,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states and 4674 transitions. [2022-12-13 19:54:35,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 3266. [2022-12-13 19:54:35,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3266 states, 3266 states have (on average 1.4311083894672383) internal successors, (4674), 3265 states have internal predecessors, (4674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:54:35,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 4674 transitions. [2022-12-13 19:54:35,491 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3266 states and 4674 transitions. [2022-12-13 19:54:35,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:54:35,492 INFO L428 stractBuchiCegarLoop]: Abstraction has 3266 states and 4674 transitions. [2022-12-13 19:54:35,492 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-12-13 19:54:35,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3266 states and 4674 transitions. [2022-12-13 19:54:35,515 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3264 [2022-12-13 19:54:35,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 19:54:35,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 19:54:35,516 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 19:54:35,516 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:54:35,517 INFO L748 eck$LassoCheckResult]: Stem: 10085#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 10055#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; 10056#L141-1 [2022-12-13 19:54:35,517 INFO L750 eck$LassoCheckResult]: Loop: 10056#L141-1 assume !false;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 10193#L40 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; 10194#L63 assume !(0 != main_~p1~0#1); 10171#L63-2 assume !(0 != main_~p2~0#1); 10173#L67-1 assume !(0 != main_~p3~0#1); 10149#L71-1 assume !(0 != main_~p4~0#1); 10151#L75-1 assume !(0 != main_~p5~0#1); 10132#L79-1 assume !(0 != main_~p6~0#1); 10134#L83-1 assume !(0 != main_~p7~0#1); 10256#L87-1 assume !(0 != main_~p8~0#1); 10255#L91-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 10253#L95-1 assume !(0 != main_~p1~0#1); 10249#L101-1 assume !(0 != main_~p2~0#1); 10246#L106-1 assume !(0 != main_~p3~0#1); 10241#L111-1 assume !(0 != main_~p4~0#1); 10237#L116-1 assume !(0 != main_~p5~0#1); 10233#L121-1 assume !(0 != main_~p6~0#1); 10230#L126-1 assume !(0 != main_~p7~0#1); 10231#L131-1 assume !(0 != main_~p8~0#1); 10210#L136-1 assume !(0 != main_~p9~0#1); 10056#L141-1 [2022-12-13 19:54:35,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:54:35,517 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2022-12-13 19:54:35,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:54:35,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218629979] [2022-12-13 19:54:35,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:54:35,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:54:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:54:35,522 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:54:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:54:35,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 19:54:35,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:54:35,526 INFO L85 PathProgramCache]: Analyzing trace with hash -511376041, now seen corresponding path program 1 times [2022-12-13 19:54:35,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:54:35,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499157749] [2022-12-13 19:54:35,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:54:35,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:54:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:54:35,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:54:35,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:54:35,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499157749] [2022-12-13 19:54:35,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499157749] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:54:35,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:54:35,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:54:35,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142394780] [2022-12-13 19:54:35,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:54:35,544 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 19:54:35,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:54:35,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:54:35,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:54:35,545 INFO L87 Difference]: Start difference. First operand 3266 states and 4674 transitions. cyclomatic complexity: 1536 Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:54:35,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:54:35,579 INFO L93 Difference]: Finished difference Result 6402 states and 8962 transitions. [2022-12-13 19:54:35,579 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6402 states and 8962 transitions. [2022-12-13 19:54:35,605 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 6400 [2022-12-13 19:54:35,621 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6402 states to 6402 states and 8962 transitions. [2022-12-13 19:54:35,621 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6402 [2022-12-13 19:54:35,624 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6402 [2022-12-13 19:54:35,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6402 states and 8962 transitions. [2022-12-13 19:54:35,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:54:35,630 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6402 states and 8962 transitions. [2022-12-13 19:54:35,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6402 states and 8962 transitions. [2022-12-13 19:54:35,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6402 to 6402. [2022-12-13 19:54:35,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6402 states, 6402 states have (on average 1.3998750390502968) internal successors, (8962), 6401 states have internal predecessors, (8962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:54:35,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6402 states to 6402 states and 8962 transitions. [2022-12-13 19:54:35,750 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6402 states and 8962 transitions. [2022-12-13 19:54:35,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:54:35,751 INFO L428 stractBuchiCegarLoop]: Abstraction has 6402 states and 8962 transitions. [2022-12-13 19:54:35,751 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-12-13 19:54:35,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6402 states and 8962 transitions. [2022-12-13 19:54:35,773 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 6400 [2022-12-13 19:54:35,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 19:54:35,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 19:54:35,773 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 19:54:35,773 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:54:35,774 INFO L748 eck$LassoCheckResult]: Stem: 19763#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 19729#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_~cond~0#1; 19730#L141-1 [2022-12-13 19:54:35,774 INFO L750 eck$LassoCheckResult]: Loop: 19730#L141-1 assume !false;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; 19925#L40 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; 19922#L63 assume !(0 != main_~p1~0#1); 19923#L63-2 assume !(0 != main_~p2~0#1); 19902#L67-1 assume !(0 != main_~p3~0#1); 19903#L71-1 assume !(0 != main_~p4~0#1); 19886#L75-1 assume !(0 != main_~p5~0#1); 19888#L79-1 assume !(0 != main_~p6~0#1); 19862#L83-1 assume !(0 != main_~p7~0#1); 19864#L87-1 assume !(0 != main_~p8~0#1); 19838#L91-1 assume !(0 != main_~p9~0#1); 19840#L95-1 assume !(0 != main_~p1~0#1); 19949#L101-1 assume !(0 != main_~p2~0#1); 19948#L106-1 assume !(0 != main_~p3~0#1); 19945#L111-1 assume !(0 != main_~p4~0#1); 19943#L116-1 assume !(0 != main_~p5~0#1); 19941#L121-1 assume !(0 != main_~p6~0#1); 19937#L126-1 assume !(0 != main_~p7~0#1); 19933#L131-1 assume !(0 != main_~p8~0#1); 19929#L136-1 assume !(0 != main_~p9~0#1); 19730#L141-1 [2022-12-13 19:54:35,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:54:35,774 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2022-12-13 19:54:35,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:54:35,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777263999] [2022-12-13 19:54:35,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:54:35,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:54:35,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:54:35,778 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:54:35,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:54:35,782 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 19:54:35,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:54:35,783 INFO L85 PathProgramCache]: Analyzing trace with hash -904403051, now seen corresponding path program 1 times [2022-12-13 19:54:35,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:54:35,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405319314] [2022-12-13 19:54:35,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:54:35,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:54:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:54:35,788 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:54:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:54:35,793 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 19:54:35,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:54:35,794 INFO L85 PathProgramCache]: Analyzing trace with hash 551712343, now seen corresponding path program 1 times [2022-12-13 19:54:35,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:54:35,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367561286] [2022-12-13 19:54:35,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:54:35,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:54:35,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:54:35,800 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:54:35,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:54:35,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 19:54:36,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:54:36,081 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:54:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:54:36,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.12 07:54:36 BoogieIcfgContainer [2022-12-13 19:54:36,113 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-12-13 19:54:36,114 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 19:54:36,114 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 19:54:36,114 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 19:54:36,114 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:54:34" (3/4) ... [2022-12-13 19:54:36,116 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-12-13 19:54:36,145 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ae9e92e-157f-47f6-8395-0e8ec0efb9c5/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 19:54:36,146 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 19:54:36,146 INFO L158 Benchmark]: Toolchain (without parser) took 2162.84ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 118.9MB in the beginning and 84.2MB in the end (delta: 34.7MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. [2022-12-13 19:54:36,146 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 117.4MB. Free memory is still 87.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 19:54:36,147 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.31ms. Allocated memory is still 155.2MB. Free memory was 118.9MB in the beginning and 122.0MB in the end (delta: -3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-13 19:54:36,147 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.46ms. Allocated memory is still 155.2MB. Free memory was 122.0MB in the beginning and 120.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 19:54:36,147 INFO L158 Benchmark]: Boogie Preprocessor took 15.03ms. Allocated memory is still 155.2MB. Free memory was 120.4MB in the beginning and 119.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 19:54:36,147 INFO L158 Benchmark]: RCFGBuilder took 258.17ms. Allocated memory is still 155.2MB. Free memory was 119.1MB in the beginning and 106.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-13 19:54:36,148 INFO L158 Benchmark]: BuchiAutomizer took 1637.60ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 106.5MB in the beginning and 86.3MB in the end (delta: 20.2MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. [2022-12-13 19:54:36,148 INFO L158 Benchmark]: Witness Printer took 32.06ms. Allocated memory is still 186.6MB. Free memory was 86.3MB in the beginning and 84.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 19:54:36,150 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 117.4MB. Free memory is still 87.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 193.31ms. Allocated memory is still 155.2MB. Free memory was 118.9MB in the beginning and 122.0MB in the end (delta: -3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.46ms. Allocated memory is still 155.2MB. Free memory was 122.0MB in the beginning and 120.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.03ms. Allocated memory is still 155.2MB. Free memory was 120.4MB in the beginning and 119.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 258.17ms. Allocated memory is still 155.2MB. Free memory was 119.1MB in the beginning and 106.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 1637.60ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 106.5MB in the beginning and 86.3MB in the end (delta: 20.2MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. * Witness Printer took 32.06ms. Allocated memory is still 186.6MB. Free memory was 86.3MB in the beginning and 84.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (8 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.8 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 6402 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.5s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 0.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 0. Minimization of det autom 8. Minimization of nondet autom 0. Automata minimization 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 301 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 301 mSDsluCounter, 939 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 356 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 40 IncrementalHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 583 mSDtfsCounter, 40 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI8 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 38]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L36] int cond; Loop: [L38] COND TRUE 1 [L39] cond = __VERIFIER_nondet_int() [L40] COND FALSE !(cond == 0) [L43] lk1 = 0 [L45] lk2 = 0 [L47] lk3 = 0 [L49] lk4 = 0 [L51] lk5 = 0 [L53] lk6 = 0 [L55] lk7 = 0 [L57] lk8 = 0 [L59] lk9 = 0 [L63] COND FALSE !(p1 != 0) [L67] COND FALSE !(p2 != 0) [L71] COND FALSE !(p3 != 0) [L75] COND FALSE !(p4 != 0) [L79] COND FALSE !(p5 != 0) [L83] COND FALSE !(p6 != 0) [L87] COND FALSE !(p7 != 0) [L91] COND FALSE !(p8 != 0) [L95] COND FALSE !(p9 != 0) [L101] COND FALSE !(p1 != 0) [L106] COND FALSE !(p2 != 0) [L111] COND FALSE !(p3 != 0) [L116] COND FALSE !(p4 != 0) [L121] COND FALSE !(p5 != 0) [L126] COND FALSE !(p6 != 0) [L131] COND FALSE !(p7 != 0) [L136] COND FALSE !(p8 != 0) [L141] COND FALSE !(p9 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 38]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L36] int cond; Loop: [L38] COND TRUE 1 [L39] cond = __VERIFIER_nondet_int() [L40] COND FALSE !(cond == 0) [L43] lk1 = 0 [L45] lk2 = 0 [L47] lk3 = 0 [L49] lk4 = 0 [L51] lk5 = 0 [L53] lk6 = 0 [L55] lk7 = 0 [L57] lk8 = 0 [L59] lk9 = 0 [L63] COND FALSE !(p1 != 0) [L67] COND FALSE !(p2 != 0) [L71] COND FALSE !(p3 != 0) [L75] COND FALSE !(p4 != 0) [L79] COND FALSE !(p5 != 0) [L83] COND FALSE !(p6 != 0) [L87] COND FALSE !(p7 != 0) [L91] COND FALSE !(p8 != 0) [L95] COND FALSE !(p9 != 0) [L101] COND FALSE !(p1 != 0) [L106] COND FALSE !(p2 != 0) [L111] COND FALSE !(p3 != 0) [L116] COND FALSE !(p4 != 0) [L121] COND FALSE !(p5 != 0) [L126] COND FALSE !(p6 != 0) [L131] COND FALSE !(p7 != 0) [L136] COND FALSE !(p8 != 0) [L141] COND FALSE !(p9 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-12-13 19:54:36,168 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ae9e92e-157f-47f6-8395-0e8ec0efb9c5/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)