./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6eb395-94c1-4e03-977c-dfacb947e2f2/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6eb395-94c1-4e03-977c-dfacb947e2f2/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6eb395-94c1-4e03-977c-dfacb947e2f2/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6eb395-94c1-4e03-977c-dfacb947e2f2/bin/uautomizer-Dbtcem3rbc/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_11.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6eb395-94c1-4e03-977c-dfacb947e2f2/bin/uautomizer-Dbtcem3rbc/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6eb395-94c1-4e03-977c-dfacb947e2f2/bin/uautomizer-Dbtcem3rbc --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 dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 --- 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-5e519f3 [2022-11-02 20:52:41,207 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:52:41,210 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:52:41,256 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:52:41,256 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:52:41,260 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:52:41,262 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:52:41,267 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:52:41,270 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:52:41,279 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:52:41,280 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:52:41,282 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:52:41,283 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:52:41,285 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:52:41,287 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:52:41,289 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:52:41,291 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:52:41,292 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:52:41,293 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:52:41,300 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:52:41,302 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:52:41,303 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:52:41,306 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:52:41,307 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:52:41,315 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:52:41,316 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:52:41,316 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:52:41,318 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:52:41,319 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:52:41,320 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:52:41,320 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:52:41,321 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:52:41,323 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:52:41,326 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:52:41,327 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:52:41,327 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:52:41,328 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:52:41,329 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:52:41,329 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:52:41,330 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:52:41,331 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:52:41,332 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6eb395-94c1-4e03-977c-dfacb947e2f2/bin/uautomizer-Dbtcem3rbc/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-02 20:52:41,372 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:52:41,372 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:52:41,373 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:52:41,373 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:52:41,375 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:52:41,376 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:52:41,376 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:52:41,376 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-02 20:52:41,377 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-02 20:52:41,377 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-02 20:52:41,378 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-02 20:52:41,379 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-02 20:52:41,379 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-02 20:52:41,379 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:52:41,380 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:52:41,380 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:52:41,380 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:52:41,380 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:52:41,381 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:52:41,381 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-02 20:52:41,381 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-02 20:52:41,382 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-02 20:52:41,382 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:52:41,384 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:52:41,384 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-02 20:52:41,384 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:52:41,385 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-02 20:52:41,385 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:52:41,385 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:52:41,386 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:52:41,386 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:52:41,387 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-02 20:52:41,388 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_2b6eb395-94c1-4e03-977c-dfacb947e2f2/bin/uautomizer-Dbtcem3rbc/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_2b6eb395-94c1-4e03-977c-dfacb947e2f2/bin/uautomizer-Dbtcem3rbc 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 -> dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 [2022-11-02 20:52:41,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:52:41,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:52:41,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:52:41,694 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:52:41,695 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:52:41,696 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6eb395-94c1-4e03-977c-dfacb947e2f2/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/locks/test_locks_11.c [2022-11-02 20:52:41,776 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6eb395-94c1-4e03-977c-dfacb947e2f2/bin/uautomizer-Dbtcem3rbc/data/9964503b8/f3c39a659308459f941055da62a8308d/FLAG3c182cc2c [2022-11-02 20:52:42,267 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:52:42,268 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6eb395-94c1-4e03-977c-dfacb947e2f2/sv-benchmarks/c/locks/test_locks_11.c [2022-11-02 20:52:42,283 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6eb395-94c1-4e03-977c-dfacb947e2f2/bin/uautomizer-Dbtcem3rbc/data/9964503b8/f3c39a659308459f941055da62a8308d/FLAG3c182cc2c [2022-11-02 20:52:42,640 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6eb395-94c1-4e03-977c-dfacb947e2f2/bin/uautomizer-Dbtcem3rbc/data/9964503b8/f3c39a659308459f941055da62a8308d [2022-11-02 20:52:42,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:52:42,650 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:52:42,656 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:52:42,656 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:52:42,661 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:52:42,661 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:52:42" (1/1) ... [2022-11-02 20:52:42,665 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50bce7a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:42, skipping insertion in model container [2022-11-02 20:52:42,665 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:52:42" (1/1) ... [2022-11-02 20:52:42,674 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:52:42,698 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:52:42,931 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6eb395-94c1-4e03-977c-dfacb947e2f2/sv-benchmarks/c/locks/test_locks_11.c[4246,4259] [2022-11-02 20:52:42,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:52:42,943 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:52:42,968 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6eb395-94c1-4e03-977c-dfacb947e2f2/sv-benchmarks/c/locks/test_locks_11.c[4246,4259] [2022-11-02 20:52:42,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:52:42,983 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:52:42,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:42 WrapperNode [2022-11-02 20:52:42,984 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:52:42,985 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:52:42,985 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:52:42,985 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:52:42,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:42" (1/1) ... [2022-11-02 20:52:43,000 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:42" (1/1) ... [2022-11-02 20:52:43,023 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 137 [2022-11-02 20:52:43,023 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:52:43,024 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:52:43,024 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:52:43,024 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:52:43,033 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:42" (1/1) ... [2022-11-02 20:52:43,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:42" (1/1) ... [2022-11-02 20:52:43,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:42" (1/1) ... [2022-11-02 20:52:43,036 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:42" (1/1) ... [2022-11-02 20:52:43,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:42" (1/1) ... [2022-11-02 20:52:43,046 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:42" (1/1) ... [2022-11-02 20:52:43,048 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:42" (1/1) ... [2022-11-02 20:52:43,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:42" (1/1) ... [2022-11-02 20:52:43,051 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:52:43,052 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:52:43,052 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:52:43,053 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:52:43,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:42" (1/1) ... [2022-11-02 20:52:43,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:52:43,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6eb395-94c1-4e03-977c-dfacb947e2f2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:52:43,090 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6eb395-94c1-4e03-977c-dfacb947e2f2/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:52:43,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6eb395-94c1-4e03-977c-dfacb947e2f2/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-02 20:52:43,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:52:43,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:52:43,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:52:43,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:52:43,220 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:52:43,222 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:52:43,467 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:52:43,475 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:52:43,475 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:52:43,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:52:43 BoogieIcfgContainer [2022-11-02 20:52:43,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:52:43,478 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-02 20:52:43,479 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-02 20:52:43,495 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-02 20:52:43,496 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-02 20:52:43,497 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.11 08:52:42" (1/3) ... [2022-11-02 20:52:43,498 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54ff503c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.11 08:52:43, skipping insertion in model container [2022-11-02 20:52:43,498 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-02 20:52:43,498 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:42" (2/3) ... [2022-11-02 20:52:43,499 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54ff503c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.11 08:52:43, skipping insertion in model container [2022-11-02 20:52:43,499 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-02 20:52:43,499 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:52:43" (3/3) ... [2022-11-02 20:52:43,500 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_11.c [2022-11-02 20:52:43,612 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-02 20:52:43,612 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-02 20:52:43,612 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-02 20:52:43,612 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-02 20:52:43,612 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-02 20:52:43,613 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-02 20:52:43,613 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-02 20:52:43,613 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-02 20:52:43,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 41 states have internal predecessors, (77), 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-11-02 20:52:43,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2022-11-02 20:52:43,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:52:43,658 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:52:43,665 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 20:52:43,665 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:43,666 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-02 20:52:43,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 41 states have internal predecessors, (77), 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-11-02 20:52:43,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2022-11-02 20:52:43,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:52:43,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:52:43,672 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 20:52:43,672 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:43,685 INFO L748 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 27#L169-1true [2022-11-02 20:52:43,695 INFO L750 eck$LassoCheckResult]: Loop: 27#L169-1true assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 14#L46true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 40#L73true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 41#L73-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 28#L77-1true assume !(0 != main_~p3~0#1); 5#L81-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 24#L85-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 18#L89-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 12#L93-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 21#L97-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 29#L101-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 35#L105-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 25#L109-1true assume !(0 != main_~p11~0#1); 20#L113-1true assume !(0 != main_~p1~0#1); 36#L119-1true assume !(0 != main_~p2~0#1); 8#L124-1true assume !(0 != main_~p3~0#1); 11#L129-1true assume !(0 != main_~p4~0#1); 19#L134-1true assume !(0 != main_~p5~0#1); 10#L139-1true assume !(0 != main_~p6~0#1); 3#L144-1true assume !(0 != main_~p7~0#1); 34#L149-1true assume !(0 != main_~p8~0#1); 17#L154-1true assume !(0 != main_~p9~0#1); 7#L159-1true assume !(0 != main_~p10~0#1); 38#L164-1true assume !(0 != main_~p11~0#1); 27#L169-1true [2022-11-02 20:52:43,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:43,721 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-11-02 20:52:43,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:43,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761486816] [2022-11-02 20:52:43,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:43,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:52:43,894 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:52:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:52:43,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:52:43,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:43,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1430849892, now seen corresponding path program 1 times [2022-11-02 20:52:43,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:43,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131883488] [2022-11-02 20:52:43,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:43,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:44,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:44,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:44,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131883488] [2022-11-02 20:52:44,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131883488] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:44,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:44,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:44,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745537893] [2022-11-02 20:52:44,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:44,178 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:52:44,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:44,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:44,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:44,216 INFO L87 Difference]: Start difference. First operand has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 41 states have internal predecessors, (77), 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 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-11-02 20:52:44,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:44,253 INFO L93 Difference]: Finished difference Result 81 states and 142 transitions. [2022-11-02 20:52:44,255 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 142 transitions. [2022-11-02 20:52:44,259 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2022-11-02 20:52:44,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 71 states and 113 transitions. [2022-11-02 20:52:44,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2022-11-02 20:52:44,265 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2022-11-02 20:52:44,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 113 transitions. [2022-11-02 20:52:44,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:52:44,267 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 113 transitions. [2022-11-02 20:52:44,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 113 transitions. [2022-11-02 20:52:44,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-02 20:52:44,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.591549295774648) internal successors, (113), 70 states have internal predecessors, (113), 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-11-02 20:52:44,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 113 transitions. [2022-11-02 20:52:44,326 INFO L240 hiAutomatonCegarLoop]: Abstraction has 71 states and 113 transitions. [2022-11-02 20:52:44,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:44,331 INFO L428 stractBuchiCegarLoop]: Abstraction has 71 states and 113 transitions. [2022-11-02 20:52:44,332 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-02 20:52:44,332 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 113 transitions. [2022-11-02 20:52:44,334 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2022-11-02 20:52:44,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:52:44,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:52:44,335 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 20:52:44,335 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:44,335 INFO L748 eck$LassoCheckResult]: Stem: 164#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 145#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 146#L169-1 [2022-11-02 20:52:44,336 INFO L750 eck$LassoCheckResult]: Loop: 146#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 179#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 178#L73 assume !(0 != main_~p1~0#1); 174#L73-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 168#L77-1 assume !(0 != main_~p3~0#1); 135#L81-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 136#L85-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 159#L89-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 149#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 150#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 169#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 170#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 177#L109-1 assume !(0 != main_~p11~0#1); 175#L113-1 assume !(0 != main_~p1~0#1); 176#L119-1 assume !(0 != main_~p2~0#1); 196#L124-1 assume !(0 != main_~p3~0#1); 194#L129-1 assume !(0 != main_~p4~0#1); 192#L134-1 assume !(0 != main_~p5~0#1); 190#L139-1 assume !(0 != main_~p6~0#1); 188#L144-1 assume !(0 != main_~p7~0#1); 186#L149-1 assume !(0 != main_~p8~0#1); 157#L154-1 assume !(0 != main_~p9~0#1); 139#L159-1 assume !(0 != main_~p10~0#1); 141#L164-1 assume !(0 != main_~p11~0#1); 146#L169-1 [2022-11-02 20:52:44,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:44,336 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-11-02 20:52:44,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:44,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647015667] [2022-11-02 20:52:44,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:44,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:52:44,344 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:52:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:52:44,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:52:44,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:44,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1649704610, now seen corresponding path program 1 times [2022-11-02 20:52:44,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:44,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115442036] [2022-11-02 20:52:44,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:44,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:44,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:44,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:44,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115442036] [2022-11-02 20:52:44,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115442036] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:44,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:44,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:44,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441797959] [2022-11-02 20:52:44,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:44,403 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:52:44,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:44,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:44,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:44,404 INFO L87 Difference]: Start difference. First operand 71 states and 113 transitions. cyclomatic complexity: 44 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-11-02 20:52:44,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:44,438 INFO L93 Difference]: Finished difference Result 138 states and 218 transitions. [2022-11-02 20:52:44,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 218 transitions. [2022-11-02 20:52:44,442 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 136 [2022-11-02 20:52:44,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 138 states and 218 transitions. [2022-11-02 20:52:44,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2022-11-02 20:52:44,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 138 [2022-11-02 20:52:44,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 218 transitions. [2022-11-02 20:52:44,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:52:44,446 INFO L218 hiAutomatonCegarLoop]: Abstraction has 138 states and 218 transitions. [2022-11-02 20:52:44,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 218 transitions. [2022-11-02 20:52:44,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-11-02 20:52:44,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 138 states have (on average 1.5797101449275361) internal successors, (218), 137 states have internal predecessors, (218), 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-11-02 20:52:44,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 218 transitions. [2022-11-02 20:52:44,459 INFO L240 hiAutomatonCegarLoop]: Abstraction has 138 states and 218 transitions. [2022-11-02 20:52:44,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:44,461 INFO L428 stractBuchiCegarLoop]: Abstraction has 138 states and 218 transitions. [2022-11-02 20:52:44,461 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-02 20:52:44,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 138 states and 218 transitions. [2022-11-02 20:52:44,464 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 136 [2022-11-02 20:52:44,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:52:44,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:52:44,465 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 20:52:44,465 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:44,465 INFO L748 eck$LassoCheckResult]: Stem: 379#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 360#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 361#L169-1 [2022-11-02 20:52:44,466 INFO L750 eck$LassoCheckResult]: Loop: 361#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 369#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 370#L73 assume !(0 != main_~p1~0#1); 425#L73-2 assume !(0 != main_~p2~0#1); 424#L77-1 assume !(0 != main_~p3~0#1); 421#L81-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 418#L85-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 415#L89-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 412#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 409#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 406#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 404#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 395#L109-1 assume !(0 != main_~p11~0#1); 396#L113-1 assume !(0 != main_~p1~0#1); 400#L119-1 assume !(0 != main_~p2~0#1); 357#L124-1 assume !(0 != main_~p3~0#1); 358#L129-1 assume !(0 != main_~p4~0#1); 353#L134-1 assume !(0 != main_~p5~0#1); 362#L139-1 assume !(0 != main_~p6~0#1); 363#L144-1 assume !(0 != main_~p7~0#1); 456#L149-1 assume !(0 != main_~p8~0#1); 454#L154-1 assume !(0 != main_~p9~0#1); 452#L159-1 assume !(0 != main_~p10~0#1); 388#L164-1 assume !(0 != main_~p11~0#1); 361#L169-1 [2022-11-02 20:52:44,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:44,466 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-11-02 20:52:44,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:44,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142566463] [2022-11-02 20:52:44,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:44,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:52:44,474 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:52:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:52:44,481 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:52:44,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:44,482 INFO L85 PathProgramCache]: Analyzing trace with hash 2072406436, now seen corresponding path program 1 times [2022-11-02 20:52:44,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:44,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675810814] [2022-11-02 20:52:44,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:44,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:44,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:44,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:44,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675810814] [2022-11-02 20:52:44,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675810814] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:44,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:44,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:44,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657733815] [2022-11-02 20:52:44,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:44,533 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:52:44,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:44,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:44,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:44,535 INFO L87 Difference]: Start difference. First operand 138 states and 218 transitions. cyclomatic complexity: 84 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-11-02 20:52:44,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:44,555 INFO L93 Difference]: Finished difference Result 270 states and 422 transitions. [2022-11-02 20:52:44,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 422 transitions. [2022-11-02 20:52:44,560 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 268 [2022-11-02 20:52:44,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 270 states and 422 transitions. [2022-11-02 20:52:44,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 270 [2022-11-02 20:52:44,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 270 [2022-11-02 20:52:44,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 270 states and 422 transitions. [2022-11-02 20:52:44,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:52:44,566 INFO L218 hiAutomatonCegarLoop]: Abstraction has 270 states and 422 transitions. [2022-11-02 20:52:44,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states and 422 transitions. [2022-11-02 20:52:44,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2022-11-02 20:52:44,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 270 states have (on average 1.5629629629629629) internal successors, (422), 269 states have internal predecessors, (422), 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-11-02 20:52:44,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 422 transitions. [2022-11-02 20:52:44,589 INFO L240 hiAutomatonCegarLoop]: Abstraction has 270 states and 422 transitions. [2022-11-02 20:52:44,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:44,591 INFO L428 stractBuchiCegarLoop]: Abstraction has 270 states and 422 transitions. [2022-11-02 20:52:44,591 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-02 20:52:44,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 422 transitions. [2022-11-02 20:52:44,594 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 268 [2022-11-02 20:52:44,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:52:44,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:52:44,595 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 20:52:44,595 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:44,596 INFO L748 eck$LassoCheckResult]: Stem: 793#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 774#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 775#L169-1 [2022-11-02 20:52:44,596 INFO L750 eck$LassoCheckResult]: Loop: 775#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 917#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 916#L73 assume !(0 != main_~p1~0#1); 914#L73-2 assume !(0 != main_~p2~0#1); 910#L77-1 assume !(0 != main_~p3~0#1); 906#L81-1 assume !(0 != main_~p4~0#1); 902#L85-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 898#L89-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 894#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 890#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 886#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 882#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 878#L109-1 assume !(0 != main_~p11~0#1); 872#L113-1 assume !(0 != main_~p1~0#1); 873#L119-1 assume !(0 != main_~p2~0#1); 940#L124-1 assume !(0 != main_~p3~0#1); 937#L129-1 assume !(0 != main_~p4~0#1); 936#L134-1 assume !(0 != main_~p5~0#1); 933#L139-1 assume !(0 != main_~p6~0#1); 848#L144-1 assume !(0 != main_~p7~0#1); 843#L149-1 assume !(0 != main_~p8~0#1); 842#L154-1 assume !(0 != main_~p9~0#1); 831#L159-1 assume !(0 != main_~p10~0#1); 830#L164-1 assume !(0 != main_~p11~0#1); 775#L169-1 [2022-11-02 20:52:44,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:44,597 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-11-02 20:52:44,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:44,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192001991] [2022-11-02 20:52:44,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:44,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:52:44,604 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:52:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:52:44,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:52:44,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:44,612 INFO L85 PathProgramCache]: Analyzing trace with hash 383462694, now seen corresponding path program 1 times [2022-11-02 20:52:44,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:44,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208767361] [2022-11-02 20:52:44,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:44,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:44,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:44,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:44,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:44,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208767361] [2022-11-02 20:52:44,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208767361] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:44,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:44,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:44,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954985349] [2022-11-02 20:52:44,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:44,680 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:52:44,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:44,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:44,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:44,681 INFO L87 Difference]: Start difference. First operand 270 states and 422 transitions. cyclomatic complexity: 160 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-11-02 20:52:44,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:44,702 INFO L93 Difference]: Finished difference Result 530 states and 818 transitions. [2022-11-02 20:52:44,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 530 states and 818 transitions. [2022-11-02 20:52:44,707 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 528 [2022-11-02 20:52:44,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 530 states to 530 states and 818 transitions. [2022-11-02 20:52:44,713 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 530 [2022-11-02 20:52:44,714 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 530 [2022-11-02 20:52:44,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 530 states and 818 transitions. [2022-11-02 20:52:44,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:52:44,717 INFO L218 hiAutomatonCegarLoop]: Abstraction has 530 states and 818 transitions. [2022-11-02 20:52:44,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states and 818 transitions. [2022-11-02 20:52:44,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2022-11-02 20:52:44,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 530 states have (on average 1.5433962264150944) internal successors, (818), 529 states have internal predecessors, (818), 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-11-02 20:52:44,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 818 transitions. [2022-11-02 20:52:44,752 INFO L240 hiAutomatonCegarLoop]: Abstraction has 530 states and 818 transitions. [2022-11-02 20:52:44,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:44,754 INFO L428 stractBuchiCegarLoop]: Abstraction has 530 states and 818 transitions. [2022-11-02 20:52:44,754 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-02 20:52:44,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 530 states and 818 transitions. [2022-11-02 20:52:44,758 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 528 [2022-11-02 20:52:44,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:52:44,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:52:44,759 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 20:52:44,759 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:44,759 INFO L748 eck$LassoCheckResult]: Stem: 1600#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 1580#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 1581#L169-1 [2022-11-02 20:52:44,760 INFO L750 eck$LassoCheckResult]: Loop: 1581#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 1663#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 1661#L73 assume !(0 != main_~p1~0#1); 1657#L73-2 assume !(0 != main_~p2~0#1); 1655#L77-1 assume !(0 != main_~p3~0#1); 1651#L81-1 assume !(0 != main_~p4~0#1); 1647#L85-1 assume !(0 != main_~p5~0#1); 1645#L89-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1643#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1641#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1639#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1637#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1635#L109-1 assume !(0 != main_~p11~0#1); 1632#L113-1 assume !(0 != main_~p1~0#1); 1633#L119-1 assume !(0 != main_~p2~0#1); 1699#L124-1 assume !(0 != main_~p3~0#1); 1694#L129-1 assume !(0 != main_~p4~0#1); 1690#L134-1 assume !(0 != main_~p5~0#1); 1687#L139-1 assume !(0 != main_~p6~0#1); 1683#L144-1 assume !(0 != main_~p7~0#1); 1679#L149-1 assume !(0 != main_~p8~0#1); 1675#L154-1 assume !(0 != main_~p9~0#1); 1671#L159-1 assume !(0 != main_~p10~0#1); 1667#L164-1 assume !(0 != main_~p11~0#1); 1581#L169-1 [2022-11-02 20:52:44,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:44,760 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-11-02 20:52:44,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:44,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594554440] [2022-11-02 20:52:44,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:44,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:52:44,768 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:52:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:52:44,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:52:44,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:44,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1610682012, now seen corresponding path program 1 times [2022-11-02 20:52:44,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:44,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400300741] [2022-11-02 20:52:44,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:44,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:44,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:44,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:44,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400300741] [2022-11-02 20:52:44,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400300741] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:44,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:44,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:44,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559045030] [2022-11-02 20:52:44,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:44,813 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:52:44,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:44,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:44,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:44,815 INFO L87 Difference]: Start difference. First operand 530 states and 818 transitions. cyclomatic complexity: 304 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-11-02 20:52:44,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:44,867 INFO L93 Difference]: Finished difference Result 1042 states and 1586 transitions. [2022-11-02 20:52:44,868 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1042 states and 1586 transitions. [2022-11-02 20:52:44,876 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1040 [2022-11-02 20:52:44,885 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1042 states to 1042 states and 1586 transitions. [2022-11-02 20:52:44,886 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1042 [2022-11-02 20:52:44,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1042 [2022-11-02 20:52:44,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1042 states and 1586 transitions. [2022-11-02 20:52:44,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:52:44,893 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2022-11-02 20:52:44,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states and 1586 transitions. [2022-11-02 20:52:44,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1042. [2022-11-02 20:52:44,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 1042 states have (on average 1.5220729366602688) internal successors, (1586), 1041 states have internal predecessors, (1586), 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-11-02 20:52:44,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1586 transitions. [2022-11-02 20:52:44,954 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2022-11-02 20:52:44,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:44,960 INFO L428 stractBuchiCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2022-11-02 20:52:44,960 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-02 20:52:44,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1042 states and 1586 transitions. [2022-11-02 20:52:44,971 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1040 [2022-11-02 20:52:44,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:52:44,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:52:44,974 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 20:52:44,974 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:44,975 INFO L748 eck$LassoCheckResult]: Stem: 3176#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 3158#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 3159#L169-1 [2022-11-02 20:52:44,975 INFO L750 eck$LassoCheckResult]: Loop: 3159#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 3298#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 3294#L73 assume !(0 != main_~p1~0#1); 3290#L73-2 assume !(0 != main_~p2~0#1); 3288#L77-1 assume !(0 != main_~p3~0#1); 3286#L81-1 assume !(0 != main_~p4~0#1); 3282#L85-1 assume !(0 != main_~p5~0#1); 3278#L89-1 assume !(0 != main_~p6~0#1); 3276#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 3274#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 3272#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 3270#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 3268#L109-1 assume !(0 != main_~p11~0#1); 3264#L113-1 assume !(0 != main_~p1~0#1); 3260#L119-1 assume !(0 != main_~p2~0#1); 3257#L124-1 assume !(0 != main_~p3~0#1); 3253#L129-1 assume !(0 != main_~p4~0#1); 3254#L134-1 assume !(0 != main_~p5~0#1); 3321#L139-1 assume !(0 != main_~p6~0#1); 3318#L144-1 assume !(0 != main_~p7~0#1); 3314#L149-1 assume !(0 != main_~p8~0#1); 3310#L154-1 assume !(0 != main_~p9~0#1); 3306#L159-1 assume !(0 != main_~p10~0#1); 3302#L164-1 assume !(0 != main_~p11~0#1); 3159#L169-1 [2022-11-02 20:52:44,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:44,976 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-11-02 20:52:44,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:44,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962491719] [2022-11-02 20:52:44,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:44,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:52:44,999 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:52:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:52:45,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:52:45,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:45,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1095937382, now seen corresponding path program 1 times [2022-11-02 20:52:45,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:45,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194025443] [2022-11-02 20:52:45,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:45,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:45,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:45,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194025443] [2022-11-02 20:52:45,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194025443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:45,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:45,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:45,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553083938] [2022-11-02 20:52:45,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:45,045 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:52:45,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:45,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:45,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:45,047 INFO L87 Difference]: Start difference. First operand 1042 states and 1586 transitions. cyclomatic complexity: 576 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-11-02 20:52:45,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:45,073 INFO L93 Difference]: Finished difference Result 2050 states and 3074 transitions. [2022-11-02 20:52:45,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2050 states and 3074 transitions. [2022-11-02 20:52:45,101 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2048 [2022-11-02 20:52:45,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2050 states to 2050 states and 3074 transitions. [2022-11-02 20:52:45,114 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2050 [2022-11-02 20:52:45,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2050 [2022-11-02 20:52:45,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2050 states and 3074 transitions. [2022-11-02 20:52:45,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:52:45,120 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2022-11-02 20:52:45,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states and 3074 transitions. [2022-11-02 20:52:45,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 2050. [2022-11-02 20:52:45,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2050 states, 2050 states have (on average 1.4995121951219512) internal successors, (3074), 2049 states have internal predecessors, (3074), 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-11-02 20:52:45,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 3074 transitions. [2022-11-02 20:52:45,166 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2022-11-02 20:52:45,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:45,193 INFO L428 stractBuchiCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2022-11-02 20:52:45,196 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-11-02 20:52:45,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2050 states and 3074 transitions. [2022-11-02 20:52:45,212 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2048 [2022-11-02 20:52:45,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:52:45,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:52:45,215 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 20:52:45,215 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:45,216 INFO L748 eck$LassoCheckResult]: Stem: 6275#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 6255#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 6256#L169-1 [2022-11-02 20:52:45,216 INFO L750 eck$LassoCheckResult]: Loop: 6256#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 6363#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 6361#L73 assume !(0 != main_~p1~0#1); 6357#L73-2 assume !(0 != main_~p2~0#1); 6355#L77-1 assume !(0 != main_~p3~0#1); 6351#L81-1 assume !(0 != main_~p4~0#1); 6347#L85-1 assume !(0 != main_~p5~0#1); 6343#L89-1 assume !(0 != main_~p6~0#1); 6339#L93-1 assume !(0 != main_~p7~0#1); 6337#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 6335#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 6333#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 6331#L109-1 assume !(0 != main_~p11~0#1); 6328#L113-1 assume !(0 != main_~p1~0#1); 6329#L119-1 assume !(0 != main_~p2~0#1); 6399#L124-1 assume !(0 != main_~p3~0#1); 6394#L129-1 assume !(0 != main_~p4~0#1); 6390#L134-1 assume !(0 != main_~p5~0#1); 6386#L139-1 assume !(0 != main_~p6~0#1); 6382#L144-1 assume !(0 != main_~p7~0#1); 6379#L149-1 assume !(0 != main_~p8~0#1); 6375#L154-1 assume !(0 != main_~p9~0#1); 6371#L159-1 assume !(0 != main_~p10~0#1); 6367#L164-1 assume !(0 != main_~p11~0#1); 6256#L169-1 [2022-11-02 20:52:45,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:45,223 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2022-11-02 20:52:45,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:45,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499922155] [2022-11-02 20:52:45,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:45,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:52:45,238 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:52:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:52:45,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:52:45,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:45,256 INFO L85 PathProgramCache]: Analyzing trace with hash 74869028, now seen corresponding path program 1 times [2022-11-02 20:52:45,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:45,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855861217] [2022-11-02 20:52:45,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:45,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:45,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:45,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855861217] [2022-11-02 20:52:45,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855861217] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:45,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:45,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:45,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564687338] [2022-11-02 20:52:45,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:45,335 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:52:45,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:45,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:45,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:45,336 INFO L87 Difference]: Start difference. First operand 2050 states and 3074 transitions. cyclomatic complexity: 1088 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-11-02 20:52:45,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:45,391 INFO L93 Difference]: Finished difference Result 4034 states and 5954 transitions. [2022-11-02 20:52:45,391 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4034 states and 5954 transitions. [2022-11-02 20:52:45,430 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4032 [2022-11-02 20:52:45,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4034 states to 4034 states and 5954 transitions. [2022-11-02 20:52:45,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4034 [2022-11-02 20:52:45,460 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4034 [2022-11-02 20:52:45,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4034 states and 5954 transitions. [2022-11-02 20:52:45,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:52:45,467 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2022-11-02 20:52:45,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4034 states and 5954 transitions. [2022-11-02 20:52:45,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4034 to 4034. [2022-11-02 20:52:45,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4034 states, 4034 states have (on average 1.4759543877045116) internal successors, (5954), 4033 states have internal predecessors, (5954), 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-11-02 20:52:45,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4034 states to 4034 states and 5954 transitions. [2022-11-02 20:52:45,608 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2022-11-02 20:52:45,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:45,611 INFO L428 stractBuchiCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2022-11-02 20:52:45,611 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-11-02 20:52:45,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4034 states and 5954 transitions. [2022-11-02 20:52:45,634 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4032 [2022-11-02 20:52:45,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:52:45,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:52:45,635 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 20:52:45,635 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:45,635 INFO L748 eck$LassoCheckResult]: Stem: 12367#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 12345#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 12346#L169-1 [2022-11-02 20:52:45,636 INFO L750 eck$LassoCheckResult]: Loop: 12346#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 12506#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 12500#L73 assume !(0 != main_~p1~0#1); 12494#L73-2 assume !(0 != main_~p2~0#1); 12495#L77-1 assume !(0 != main_~p3~0#1); 12689#L81-1 assume !(0 != main_~p4~0#1); 12687#L85-1 assume !(0 != main_~p5~0#1); 12685#L89-1 assume !(0 != main_~p6~0#1); 12450#L93-1 assume !(0 != main_~p7~0#1); 12452#L97-1 assume !(0 != main_~p8~0#1); 12638#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 12634#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 12630#L109-1 assume !(0 != main_~p11~0#1); 12626#L113-1 assume !(0 != main_~p1~0#1); 12627#L119-1 assume !(0 != main_~p2~0#1); 12684#L124-1 assume !(0 != main_~p3~0#1); 12681#L129-1 assume !(0 != main_~p4~0#1); 12679#L134-1 assume !(0 != main_~p5~0#1); 12677#L139-1 assume !(0 != main_~p6~0#1); 12675#L144-1 assume !(0 != main_~p7~0#1); 12672#L149-1 assume !(0 != main_~p8~0#1); 12670#L154-1 assume !(0 != main_~p9~0#1); 12532#L159-1 assume !(0 != main_~p10~0#1); 12518#L164-1 assume !(0 != main_~p11~0#1); 12346#L169-1 [2022-11-02 20:52:45,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:45,636 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2022-11-02 20:52:45,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:45,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661635287] [2022-11-02 20:52:45,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:45,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:52:45,650 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:52:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:52:45,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:52:45,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:45,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1204994650, now seen corresponding path program 1 times [2022-11-02 20:52:45,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:45,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445467565] [2022-11-02 20:52:45,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:45,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:45,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:45,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445467565] [2022-11-02 20:52:45,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445467565] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:45,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:45,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:45,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610567756] [2022-11-02 20:52:45,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:45,698 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:52:45,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:45,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:45,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:45,699 INFO L87 Difference]: Start difference. First operand 4034 states and 5954 transitions. cyclomatic complexity: 2048 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-11-02 20:52:45,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:45,754 INFO L93 Difference]: Finished difference Result 7938 states and 11522 transitions. [2022-11-02 20:52:45,754 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7938 states and 11522 transitions. [2022-11-02 20:52:45,809 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7936 [2022-11-02 20:52:45,922 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7938 states to 7938 states and 11522 transitions. [2022-11-02 20:52:45,926 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7938 [2022-11-02 20:52:45,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7938 [2022-11-02 20:52:45,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7938 states and 11522 transitions. [2022-11-02 20:52:45,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:52:45,941 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2022-11-02 20:52:45,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7938 states and 11522 transitions. [2022-11-02 20:52:46,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7938 to 7938. [2022-11-02 20:52:46,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7938 states, 7938 states have (on average 1.4514991181657848) internal successors, (11522), 7937 states have internal predecessors, (11522), 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-11-02 20:52:46,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7938 states to 7938 states and 11522 transitions. [2022-11-02 20:52:46,148 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2022-11-02 20:52:46,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:46,152 INFO L428 stractBuchiCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2022-11-02 20:52:46,152 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-11-02 20:52:46,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7938 states and 11522 transitions. [2022-11-02 20:52:46,187 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7936 [2022-11-02 20:52:46,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:52:46,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:52:46,189 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 20:52:46,190 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:46,190 INFO L748 eck$LassoCheckResult]: Stem: 24342#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 24323#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 24324#L169-1 [2022-11-02 20:52:46,191 INFO L750 eck$LassoCheckResult]: Loop: 24324#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 24735#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 24728#L73 assume !(0 != main_~p1~0#1); 24720#L73-2 assume !(0 != main_~p2~0#1); 24716#L77-1 assume !(0 != main_~p3~0#1); 24714#L81-1 assume !(0 != main_~p4~0#1); 24712#L85-1 assume !(0 != main_~p5~0#1); 24710#L89-1 assume !(0 != main_~p6~0#1); 24709#L93-1 assume !(0 != main_~p7~0#1); 24707#L97-1 assume !(0 != main_~p8~0#1); 24706#L101-1 assume !(0 != main_~p9~0#1); 24702#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 24699#L109-1 assume !(0 != main_~p11~0#1); 24695#L113-1 assume !(0 != main_~p1~0#1); 24681#L119-1 assume !(0 != main_~p2~0#1); 24678#L124-1 assume !(0 != main_~p3~0#1); 24669#L129-1 assume !(0 != main_~p4~0#1); 24659#L134-1 assume !(0 != main_~p5~0#1); 24649#L139-1 assume !(0 != main_~p6~0#1); 24639#L144-1 assume !(0 != main_~p7~0#1); 24630#L149-1 assume !(0 != main_~p8~0#1); 24631#L154-1 assume !(0 != main_~p9~0#1); 24832#L159-1 assume !(0 != main_~p10~0#1); 24746#L164-1 assume !(0 != main_~p11~0#1); 24324#L169-1 [2022-11-02 20:52:46,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:46,191 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2022-11-02 20:52:46,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:46,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729159672] [2022-11-02 20:52:46,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:46,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:52:46,214 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:52:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:52:46,223 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:52:46,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:46,226 INFO L85 PathProgramCache]: Analyzing trace with hash 2078855396, now seen corresponding path program 1 times [2022-11-02 20:52:46,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:46,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301848969] [2022-11-02 20:52:46,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:46,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:46,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:46,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:46,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301848969] [2022-11-02 20:52:46,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301848969] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:46,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:46,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:52:46,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288613459] [2022-11-02 20:52:46,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:46,354 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:52:46,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:46,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:46,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:46,356 INFO L87 Difference]: Start difference. First operand 7938 states and 11522 transitions. cyclomatic complexity: 3840 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-11-02 20:52:46,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:46,519 INFO L93 Difference]: Finished difference Result 15618 states and 22274 transitions. [2022-11-02 20:52:46,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15618 states and 22274 transitions. [2022-11-02 20:52:46,631 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 15616 [2022-11-02 20:52:46,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15618 states to 15618 states and 22274 transitions. [2022-11-02 20:52:46,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15618 [2022-11-02 20:52:46,837 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15618 [2022-11-02 20:52:46,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15618 states and 22274 transitions. [2022-11-02 20:52:46,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:52:46,855 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2022-11-02 20:52:46,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15618 states and 22274 transitions. [2022-11-02 20:52:47,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15618 to 15618. [2022-11-02 20:52:47,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15618 states, 15618 states have (on average 1.4261749263670125) internal successors, (22274), 15617 states have internal predecessors, (22274), 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-11-02 20:52:47,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15618 states to 15618 states and 22274 transitions. [2022-11-02 20:52:47,187 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2022-11-02 20:52:47,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:47,189 INFO L428 stractBuchiCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2022-11-02 20:52:47,189 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-11-02 20:52:47,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15618 states and 22274 transitions. [2022-11-02 20:52:47,251 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 15616 [2022-11-02 20:52:47,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:52:47,251 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:52:47,356 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 20:52:47,356 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:47,356 INFO L748 eck$LassoCheckResult]: Stem: 47906#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 47884#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 47885#L169-1 [2022-11-02 20:52:47,356 INFO L750 eck$LassoCheckResult]: Loop: 47885#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 48601#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 48598#L73 assume !(0 != main_~p1~0#1); 48594#L73-2 assume !(0 != main_~p2~0#1); 48591#L77-1 assume !(0 != main_~p3~0#1); 48588#L81-1 assume !(0 != main_~p4~0#1); 48584#L85-1 assume !(0 != main_~p5~0#1); 48580#L89-1 assume !(0 != main_~p6~0#1); 48576#L93-1 assume !(0 != main_~p7~0#1); 48572#L97-1 assume !(0 != main_~p8~0#1); 48568#L101-1 assume !(0 != main_~p9~0#1); 48569#L105-1 assume !(0 != main_~p10~0#1); 48527#L109-1 assume !(0 != main_~p11~0#1); 48528#L113-1 assume !(0 != main_~p1~0#1); 48643#L119-1 assume !(0 != main_~p2~0#1); 48637#L124-1 assume !(0 != main_~p3~0#1); 48631#L129-1 assume !(0 != main_~p4~0#1); 48626#L134-1 assume !(0 != main_~p5~0#1); 48622#L139-1 assume !(0 != main_~p6~0#1); 48617#L144-1 assume !(0 != main_~p7~0#1); 48612#L149-1 assume !(0 != main_~p8~0#1); 48609#L154-1 assume !(0 != main_~p9~0#1); 48607#L159-1 assume !(0 != main_~p10~0#1); 48606#L164-1 assume !(0 != main_~p11~0#1); 47885#L169-1 [2022-11-02 20:52:47,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:47,357 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2022-11-02 20:52:47,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:47,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884511925] [2022-11-02 20:52:47,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:47,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:52:47,373 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:52:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:52:47,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:52:47,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:47,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1492049382, now seen corresponding path program 1 times [2022-11-02 20:52:47,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:47,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811636906] [2022-11-02 20:52:47,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:47,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:52:47,412 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:52:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:52:47,427 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:52:47,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:47,430 INFO L85 PathProgramCache]: Analyzing trace with hash 376454056, now seen corresponding path program 1 times [2022-11-02 20:52:47,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:47,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347183149] [2022-11-02 20:52:47,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:47,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:52:47,449 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:52:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:52:47,477 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:52:48,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:52:48,103 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:52:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:52:48,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.11 08:52:48 BoogieIcfgContainer [2022-11-02 20:52:48,175 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-11-02 20:52:48,176 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:52:48,176 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:52:48,176 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:52:48,177 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:52:43" (3/4) ... [2022-11-02 20:52:48,180 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-11-02 20:52:48,261 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6eb395-94c1-4e03-977c-dfacb947e2f2/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:52:48,261 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:52:48,262 INFO L158 Benchmark]: Toolchain (without parser) took 5612.53ms. Allocated memory was 109.1MB in the beginning and 484.4MB in the end (delta: 375.4MB). Free memory was 72.3MB in the beginning and 362.3MB in the end (delta: -289.9MB). Peak memory consumption was 84.7MB. Max. memory is 16.1GB. [2022-11-02 20:52:48,263 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 109.1MB. Free memory is still 88.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:52:48,264 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.28ms. Allocated memory is still 109.1MB. Free memory was 72.1MB in the beginning and 84.2MB in the end (delta: -12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:52:48,264 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.44ms. Allocated memory is still 109.1MB. Free memory was 84.2MB in the beginning and 82.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:52:48,264 INFO L158 Benchmark]: Boogie Preprocessor took 27.58ms. Allocated memory is still 109.1MB. Free memory was 82.8MB in the beginning and 81.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:52:48,265 INFO L158 Benchmark]: RCFGBuilder took 425.29ms. Allocated memory is still 109.1MB. Free memory was 81.1MB in the beginning and 68.0MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-02 20:52:48,265 INFO L158 Benchmark]: BuchiAutomizer took 4697.11ms. Allocated memory was 109.1MB in the beginning and 484.4MB in the end (delta: 375.4MB). Free memory was 68.0MB in the beginning and 365.3MB in the end (delta: -297.3MB). Peak memory consumption was 81.0MB. Max. memory is 16.1GB. [2022-11-02 20:52:48,265 INFO L158 Benchmark]: Witness Printer took 85.49ms. Allocated memory is still 484.4MB. Free memory was 364.4MB in the beginning and 362.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:52:48,267 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.30ms. Allocated memory is still 109.1MB. Free memory is still 88.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.28ms. Allocated memory is still 109.1MB. Free memory was 72.1MB in the beginning and 84.2MB in the end (delta: -12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.44ms. Allocated memory is still 109.1MB. Free memory was 84.2MB in the beginning and 82.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.58ms. Allocated memory is still 109.1MB. Free memory was 82.8MB in the beginning and 81.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 425.29ms. Allocated memory is still 109.1MB. Free memory was 81.1MB in the beginning and 68.0MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 4697.11ms. Allocated memory was 109.1MB in the beginning and 484.4MB in the end (delta: 375.4MB). Free memory was 68.0MB in the beginning and 365.3MB in the end (delta: -297.3MB). Peak memory consumption was 81.0MB. Max. memory is 16.1GB. * Witness Printer took 85.49ms. Allocated memory is still 484.4MB. Free memory was 364.4MB in the beginning and 362.3MB 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 9 terminating modules (9 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.9 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 15618 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.5s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.0s. Büchi inclusion checks took 2.1s. Highest rank in rank-based complementation 0. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 0.9s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.6s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 411 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 411 mSDsluCounter, 1287 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 491 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45 IncrementalHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 796 mSDtfsCounter, 45 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI9 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: 44]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L42] int cond; Loop: [L44] COND TRUE 1 [L45] cond = __VERIFIER_nondet_int() [L46] COND FALSE !(cond == 0) [L49] lk1 = 0 [L51] lk2 = 0 [L53] lk3 = 0 [L55] lk4 = 0 [L57] lk5 = 0 [L59] lk6 = 0 [L61] lk7 = 0 [L63] lk8 = 0 [L65] lk9 = 0 [L67] lk10 = 0 [L69] lk11 = 0 [L73] COND FALSE !(p1 != 0) [L77] COND FALSE !(p2 != 0) [L81] COND FALSE !(p3 != 0) [L85] COND FALSE !(p4 != 0) [L89] COND FALSE !(p5 != 0) [L93] COND FALSE !(p6 != 0) [L97] COND FALSE !(p7 != 0) [L101] COND FALSE !(p8 != 0) [L105] COND FALSE !(p9 != 0) [L109] COND FALSE !(p10 != 0) [L113] COND FALSE !(p11 != 0) [L119] COND FALSE !(p1 != 0) [L124] COND FALSE !(p2 != 0) [L129] COND FALSE !(p3 != 0) [L134] COND FALSE !(p4 != 0) [L139] COND FALSE !(p5 != 0) [L144] COND FALSE !(p6 != 0) [L149] COND FALSE !(p7 != 0) [L154] COND FALSE !(p8 != 0) [L159] COND FALSE !(p9 != 0) [L164] COND FALSE !(p10 != 0) [L169] COND FALSE !(p11 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 44]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L42] int cond; Loop: [L44] COND TRUE 1 [L45] cond = __VERIFIER_nondet_int() [L46] COND FALSE !(cond == 0) [L49] lk1 = 0 [L51] lk2 = 0 [L53] lk3 = 0 [L55] lk4 = 0 [L57] lk5 = 0 [L59] lk6 = 0 [L61] lk7 = 0 [L63] lk8 = 0 [L65] lk9 = 0 [L67] lk10 = 0 [L69] lk11 = 0 [L73] COND FALSE !(p1 != 0) [L77] COND FALSE !(p2 != 0) [L81] COND FALSE !(p3 != 0) [L85] COND FALSE !(p4 != 0) [L89] COND FALSE !(p5 != 0) [L93] COND FALSE !(p6 != 0) [L97] COND FALSE !(p7 != 0) [L101] COND FALSE !(p8 != 0) [L105] COND FALSE !(p9 != 0) [L109] COND FALSE !(p10 != 0) [L113] COND FALSE !(p11 != 0) [L119] COND FALSE !(p1 != 0) [L124] COND FALSE !(p2 != 0) [L129] COND FALSE !(p3 != 0) [L134] COND FALSE !(p4 != 0) [L139] COND FALSE !(p5 != 0) [L144] COND FALSE !(p6 != 0) [L149] COND FALSE !(p7 != 0) [L154] COND FALSE !(p8 != 0) [L159] COND FALSE !(p9 != 0) [L164] COND FALSE !(p10 != 0) [L169] COND FALSE !(p11 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-11-02 20:52:48,330 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b6eb395-94c1-4e03-977c-dfacb947e2f2/bin/uautomizer-Dbtcem3rbc/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)