./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_14-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1af29db-8658-462f-85b4-933036004070/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1af29db-8658-462f-85b4-933036004070/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1af29db-8658-462f-85b4-933036004070/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1af29db-8658-462f-85b4-933036004070/bin/uautomizer-ug76WZFUDN/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_14-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1af29db-8658-462f-85b4-933036004070/bin/uautomizer-ug76WZFUDN/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1af29db-8658-462f-85b4-933036004070/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1e1f6c8a80d54f6d4b7b413368cc99af6eca243b930331d178961d851b56afbd --- Real Ultimate output --- [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-6b4ec56 [2022-11-20 10:30:03,629 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:30:03,632 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:30:03,672 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:30:03,674 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:30:03,678 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:30:03,681 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:30:03,685 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:30:03,687 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:30:03,694 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:30:03,697 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:30:03,699 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:30:03,699 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:30:03,700 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:30:03,701 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:30:03,701 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:30:03,702 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:30:03,703 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:30:03,705 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:30:03,707 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:30:03,708 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:30:03,709 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:30:03,710 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:30:03,711 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:30:03,715 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:30:03,715 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:30:03,715 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:30:03,716 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:30:03,717 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:30:03,718 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:30:03,718 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:30:03,719 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:30:03,720 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:30:03,721 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:30:03,722 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:30:03,723 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:30:03,724 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:30:03,724 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:30:03,724 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:30:03,725 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:30:03,726 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:30:03,735 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1af29db-8658-462f-85b4-933036004070/bin/uautomizer-ug76WZFUDN/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-20 10:30:03,778 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:30:03,778 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:30:03,779 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:30:03,779 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:30:03,780 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:30:03,780 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:30:03,780 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:30:03,781 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-20 10:30:03,781 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-20 10:30:03,781 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-20 10:30:03,781 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-20 10:30:03,782 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-20 10:30:03,782 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-20 10:30:03,782 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:30:03,782 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:30:03,782 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:30:03,783 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:30:03,783 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:30:03,783 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:30:03,783 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-20 10:30:03,783 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-20 10:30:03,784 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-20 10:30:03,784 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:30:03,784 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:30:03,784 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-20 10:30:03,784 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:30:03,785 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-20 10:30:03,785 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:30:03,785 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:30:03,785 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:30:03,786 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:30:03,788 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-20 10:30:03,788 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_a1af29db-8658-462f-85b4-933036004070/bin/uautomizer-ug76WZFUDN/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_a1af29db-8658-462f-85b4-933036004070/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1e1f6c8a80d54f6d4b7b413368cc99af6eca243b930331d178961d851b56afbd [2022-11-20 10:30:04,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:30:04,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:30:04,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:30:04,129 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:30:04,130 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:30:04,131 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1af29db-8658-462f-85b4-933036004070/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/locks/test_locks_14-1.c [2022-11-20 10:30:07,261 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:30:07,470 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:30:07,471 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1af29db-8658-462f-85b4-933036004070/sv-benchmarks/c/locks/test_locks_14-1.c [2022-11-20 10:30:07,478 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1af29db-8658-462f-85b4-933036004070/bin/uautomizer-ug76WZFUDN/data/858978a9c/2c0263d8daeb414da34b0e96878528b9/FLAG76a3d1d64 [2022-11-20 10:30:07,492 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1af29db-8658-462f-85b4-933036004070/bin/uautomizer-ug76WZFUDN/data/858978a9c/2c0263d8daeb414da34b0e96878528b9 [2022-11-20 10:30:07,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:30:07,497 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:30:07,498 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:30:07,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:30:07,502 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:30:07,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:30:07" (1/1) ... [2022-11-20 10:30:07,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d56ddb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:07, skipping insertion in model container [2022-11-20 10:30:07,505 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:30:07" (1/1) ... [2022-11-20 10:30:07,512 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:30:07,547 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:30:07,704 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1af29db-8658-462f-85b4-933036004070/sv-benchmarks/c/locks/test_locks_14-1.c[5283,5296] [2022-11-20 10:30:07,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:30:07,719 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:30:07,746 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1af29db-8658-462f-85b4-933036004070/sv-benchmarks/c/locks/test_locks_14-1.c[5283,5296] [2022-11-20 10:30:07,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:30:07,761 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:30:07,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:07 WrapperNode [2022-11-20 10:30:07,762 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:30:07,763 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:30:07,764 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:30:07,764 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:30:07,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:07" (1/1) ... [2022-11-20 10:30:07,777 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:07" (1/1) ... [2022-11-20 10:30:07,797 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 167 [2022-11-20 10:30:07,797 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:30:07,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:30:07,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:30:07,798 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:30:07,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:07" (1/1) ... [2022-11-20 10:30:07,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:07" (1/1) ... [2022-11-20 10:30:07,807 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:07" (1/1) ... [2022-11-20 10:30:07,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:07" (1/1) ... [2022-11-20 10:30:07,817 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:07" (1/1) ... [2022-11-20 10:30:07,823 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:07" (1/1) ... [2022-11-20 10:30:07,825 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:07" (1/1) ... [2022-11-20 10:30:07,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:07" (1/1) ... [2022-11-20 10:30:07,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:30:07,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:30:07,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:30:07,830 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:30:07,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:07" (1/1) ... [2022-11-20 10:30:07,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:30:07,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1af29db-8658-462f-85b4-933036004070/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:30:07,864 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1af29db-8658-462f-85b4-933036004070/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:30:07,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1af29db-8658-462f-85b4-933036004070/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-20 10:30:07,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:30:07,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:30:07,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:30:07,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:30:07,983 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:30:07,985 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:30:08,241 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:30:08,248 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:30:08,249 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 10:30:08,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:30:08 BoogieIcfgContainer [2022-11-20 10:30:08,251 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:30:08,252 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-20 10:30:08,253 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-20 10:30:08,257 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-20 10:30:08,258 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-20 10:30:08,258 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 10:30:07" (1/3) ... [2022-11-20 10:30:08,259 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2dcade41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:30:08, skipping insertion in model container [2022-11-20 10:30:08,260 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-20 10:30:08,260 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:07" (2/3) ... [2022-11-20 10:30:08,260 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2dcade41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:30:08, skipping insertion in model container [2022-11-20 10:30:08,261 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-20 10:30:08,261 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:30:08" (3/3) ... [2022-11-20 10:30:08,262 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_14-1.c [2022-11-20 10:30:08,354 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-20 10:30:08,354 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-20 10:30:08,355 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-20 10:30:08,355 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-20 10:30:08,355 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-20 10:30:08,356 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-20 10:30:08,356 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-20 10:30:08,356 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-20 10:30:08,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:08,388 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2022-11-20 10:30:08,389 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:30:08,389 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:30:08,396 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 10:30:08,396 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, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:08,397 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-20 10:30:08,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:08,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2022-11-20 10:30:08,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:30:08,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:30:08,418 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 10:30:08,418 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, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:08,430 INFO L748 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 34#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 36#L211-1true [2022-11-20 10:30:08,433 INFO L750 eck$LassoCheckResult]: Loop: 36#L211-1true assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 45#L55true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 21#L88true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 11#L88-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 32#L92-1true assume !(0 != main_~p3~0#1); 3#L96-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 6#L100-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 48#L104-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 12#L108-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 51#L112-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 25#L116-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 39#L120-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 33#L124-1true assume !(0 != main_~p11~0#1); 15#L128-1true assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 46#L132-1true assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 42#L136-1true assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 38#L140-1true assume !(0 != main_~p1~0#1); 16#L146-1true assume !(0 != main_~p2~0#1); 30#L151-1true assume !(0 != main_~p3~0#1); 28#L156-1true assume !(0 != main_~p4~0#1); 4#L161-1true assume !(0 != main_~p5~0#1); 10#L166-1true assume !(0 != main_~p6~0#1); 23#L171-1true assume !(0 != main_~p7~0#1); 19#L176-1true assume !(0 != main_~p8~0#1); 49#L181-1true assume !(0 != main_~p9~0#1); 20#L186-1true assume !(0 != main_~p10~0#1); 37#L191-1true assume !(0 != main_~p11~0#1); 50#L196-1true assume !(0 != main_~p12~0#1); 24#L201-1true assume !(0 != main_~p13~0#1); 13#L206-1true assume !(0 != main_~p14~0#1); 36#L211-1true [2022-11-20 10:30:08,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:08,446 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-11-20 10:30:08,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:08,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013220557] [2022-11-20 10:30:08,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:08,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:08,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:30:08,601 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:30:08,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:30:08,647 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:30:08,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:08,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1221430905, now seen corresponding path program 1 times [2022-11-20 10:30:08,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:08,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63721854] [2022-11-20 10:30:08,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:08,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:08,784 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-20 10:30:08,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:08,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63721854] [2022-11-20 10:30:08,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63721854] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:08,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:08,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:30:08,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086835473] [2022-11-20 10:30:08,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:08,793 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 10:30:08,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:08,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:30:08,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:30:08,835 INFO L87 Difference]: Start difference. First operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:08,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:08,883 INFO L93 Difference]: Finished difference Result 99 states and 178 transitions. [2022-11-20 10:30:08,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 178 transitions. [2022-11-20 10:30:08,893 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2022-11-20 10:30:08,905 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 89 states and 143 transitions. [2022-11-20 10:30:08,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2022-11-20 10:30:08,914 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2022-11-20 10:30:08,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 143 transitions. [2022-11-20 10:30:08,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:30:08,917 INFO L218 hiAutomatonCegarLoop]: Abstraction has 89 states and 143 transitions. [2022-11-20 10:30:08,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 143 transitions. [2022-11-20 10:30:08,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-11-20 10:30:08,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.6067415730337078) internal successors, (143), 88 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:08,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 143 transitions. [2022-11-20 10:30:08,981 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 143 transitions. [2022-11-20 10:30:08,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:30:08,995 INFO L428 stractBuchiCegarLoop]: Abstraction has 89 states and 143 transitions. [2022-11-20 10:30:08,996 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-20 10:30:08,997 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 143 transitions. [2022-11-20 10:30:08,999 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2022-11-20 10:30:09,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:30:09,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:30:09,001 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 10:30:09,001 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, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:09,001 INFO L748 eck$LassoCheckResult]: Stem: 190#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 174#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 168#L211-1 [2022-11-20 10:30:09,001 INFO L750 eck$LassoCheckResult]: Loop: 168#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 179#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 202#L88 assume !(0 != main_~p1~0#1); 221#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 220#L92-1 assume !(0 != main_~p3~0#1); 219#L96-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 218#L100-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 208#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 185#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 186#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 205#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 183#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 172#L124-1 assume !(0 != main_~p11~0#1); 173#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 192#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 213#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 211#L140-1 assume !(0 != main_~p1~0#1); 212#L146-1 assume !(0 != main_~p2~0#1); 246#L151-1 assume !(0 != main_~p3~0#1); 244#L156-1 assume !(0 != main_~p4~0#1); 242#L161-1 assume !(0 != main_~p5~0#1); 240#L166-1 assume !(0 != main_~p6~0#1); 237#L171-1 assume !(0 != main_~p7~0#1); 236#L176-1 assume !(0 != main_~p8~0#1); 207#L181-1 assume !(0 != main_~p9~0#1); 194#L186-1 assume !(0 != main_~p10~0#1); 180#L191-1 assume !(0 != main_~p11~0#1); 176#L196-1 assume !(0 != main_~p12~0#1); 189#L201-1 assume !(0 != main_~p13~0#1); 166#L206-1 assume !(0 != main_~p14~0#1); 168#L211-1 [2022-11-20 10:30:09,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:09,002 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-11-20 10:30:09,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:09,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406464783] [2022-11-20 10:30:09,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:09,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:30:09,019 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:30:09,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:30:09,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:30:09,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:09,029 INFO L85 PathProgramCache]: Analyzing trace with hash 711957815, now seen corresponding path program 1 times [2022-11-20 10:30:09,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:09,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521778213] [2022-11-20 10:30:09,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:09,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:09,152 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-20 10:30:09,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:09,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521778213] [2022-11-20 10:30:09,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521778213] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:09,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:09,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:30:09,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674818165] [2022-11-20 10:30:09,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:09,154 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 10:30:09,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:09,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:30:09,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:30:09,156 INFO L87 Difference]: Start difference. First operand 89 states and 143 transitions. cyclomatic complexity: 56 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:09,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:09,186 INFO L93 Difference]: Finished difference Result 174 states and 278 transitions. [2022-11-20 10:30:09,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 278 transitions. [2022-11-20 10:30:09,194 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2022-11-20 10:30:09,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 174 states and 278 transitions. [2022-11-20 10:30:09,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2022-11-20 10:30:09,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2022-11-20 10:30:09,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 278 transitions. [2022-11-20 10:30:09,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:30:09,198 INFO L218 hiAutomatonCegarLoop]: Abstraction has 174 states and 278 transitions. [2022-11-20 10:30:09,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 278 transitions. [2022-11-20 10:30:09,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2022-11-20 10:30:09,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 174 states have (on average 1.5977011494252873) internal successors, (278), 173 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:09,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 278 transitions. [2022-11-20 10:30:09,214 INFO L240 hiAutomatonCegarLoop]: Abstraction has 174 states and 278 transitions. [2022-11-20 10:30:09,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:30:09,218 INFO L428 stractBuchiCegarLoop]: Abstraction has 174 states and 278 transitions. [2022-11-20 10:30:09,218 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-20 10:30:09,218 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 278 transitions. [2022-11-20 10:30:09,222 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2022-11-20 10:30:09,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:30:09,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:30:09,227 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 10:30:09,227 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, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:09,227 INFO L748 eck$LassoCheckResult]: Stem: 465#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 444#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 445#L211-1 [2022-11-20 10:30:09,229 INFO L750 eck$LassoCheckResult]: Loop: 445#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 527#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 525#L88 assume !(0 != main_~p1~0#1); 522#L88-2 assume !(0 != main_~p2~0#1); 517#L92-1 assume !(0 != main_~p3~0#1); 516#L96-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 514#L100-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 512#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 511#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 510#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 509#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 508#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 507#L124-1 assume !(0 != main_~p11~0#1); 506#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 505#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 489#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 490#L140-1 assume !(0 != main_~p1~0#1); 499#L146-1 assume !(0 != main_~p2~0#1); 501#L151-1 assume !(0 != main_~p3~0#1); 550#L156-1 assume !(0 != main_~p4~0#1); 548#L161-1 assume !(0 != main_~p5~0#1); 546#L166-1 assume !(0 != main_~p6~0#1); 543#L171-1 assume !(0 != main_~p7~0#1); 542#L176-1 assume !(0 != main_~p8~0#1); 540#L181-1 assume !(0 != main_~p9~0#1); 537#L186-1 assume !(0 != main_~p10~0#1); 536#L191-1 assume !(0 != main_~p11~0#1); 534#L196-1 assume !(0 != main_~p12~0#1); 532#L201-1 assume !(0 != main_~p13~0#1); 530#L206-1 assume !(0 != main_~p14~0#1); 445#L211-1 [2022-11-20 10:30:09,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:09,230 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-11-20 10:30:09,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:09,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059465817] [2022-11-20 10:30:09,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:09,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:30:09,235 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:30:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:30:09,242 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:30:09,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:09,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1659781447, now seen corresponding path program 1 times [2022-11-20 10:30:09,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:09,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051403266] [2022-11-20 10:30:09,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:09,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:09,318 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-20 10:30:09,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:09,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051403266] [2022-11-20 10:30:09,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051403266] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:09,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:09,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:30:09,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268353306] [2022-11-20 10:30:09,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:09,320 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 10:30:09,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:09,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:30:09,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:30:09,325 INFO L87 Difference]: Start difference. First operand 174 states and 278 transitions. cyclomatic complexity: 108 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:09,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:09,377 INFO L93 Difference]: Finished difference Result 342 states and 542 transitions. [2022-11-20 10:30:09,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 342 states and 542 transitions. [2022-11-20 10:30:09,381 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2022-11-20 10:30:09,388 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 342 states to 342 states and 542 transitions. [2022-11-20 10:30:09,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 342 [2022-11-20 10:30:09,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 342 [2022-11-20 10:30:09,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 342 states and 542 transitions. [2022-11-20 10:30:09,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:30:09,397 INFO L218 hiAutomatonCegarLoop]: Abstraction has 342 states and 542 transitions. [2022-11-20 10:30:09,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states and 542 transitions. [2022-11-20 10:30:09,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2022-11-20 10:30:09,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 342 states have (on average 1.5847953216374269) internal successors, (542), 341 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:09,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 542 transitions. [2022-11-20 10:30:09,421 INFO L240 hiAutomatonCegarLoop]: Abstraction has 342 states and 542 transitions. [2022-11-20 10:30:09,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:30:09,422 INFO L428 stractBuchiCegarLoop]: Abstraction has 342 states and 542 transitions. [2022-11-20 10:30:09,422 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-20 10:30:09,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 342 states and 542 transitions. [2022-11-20 10:30:09,425 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2022-11-20 10:30:09,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:30:09,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:30:09,426 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 10:30:09,426 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, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:09,426 INFO L748 eck$LassoCheckResult]: Stem: 983#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 967#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 968#L211-1 [2022-11-20 10:30:09,427 INFO L750 eck$LassoCheckResult]: Loop: 968#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 1027#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 1022#L88 assume !(0 != main_~p1~0#1); 1023#L88-2 assume !(0 != main_~p2~0#1); 1152#L92-1 assume !(0 != main_~p3~0#1); 1149#L96-1 assume !(0 != main_~p4~0#1); 1147#L100-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 1145#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1143#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1141#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1139#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1137#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1135#L124-1 assume !(0 != main_~p11~0#1); 1133#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1131#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 1129#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 1125#L140-1 assume !(0 != main_~p1~0#1); 1123#L146-1 assume !(0 != main_~p2~0#1); 1121#L151-1 assume !(0 != main_~p3~0#1); 1116#L156-1 assume !(0 != main_~p4~0#1); 1114#L161-1 assume !(0 != main_~p5~0#1); 1108#L166-1 assume !(0 != main_~p6~0#1); 1103#L171-1 assume !(0 != main_~p7~0#1); 1100#L176-1 assume !(0 != main_~p8~0#1); 1098#L181-1 assume !(0 != main_~p9~0#1); 1095#L186-1 assume !(0 != main_~p10~0#1); 1092#L191-1 assume !(0 != main_~p11~0#1); 1088#L196-1 assume !(0 != main_~p12~0#1); 1068#L201-1 assume !(0 != main_~p13~0#1); 1038#L206-1 assume !(0 != main_~p14~0#1); 968#L211-1 [2022-11-20 10:30:09,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:09,428 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-11-20 10:30:09,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:09,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221247009] [2022-11-20 10:30:09,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:09,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:30:09,434 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:30:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:30:09,441 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:30:09,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:09,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1519232837, now seen corresponding path program 1 times [2022-11-20 10:30:09,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:09,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087205262] [2022-11-20 10:30:09,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:09,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:09,484 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-20 10:30:09,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:09,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087205262] [2022-11-20 10:30:09,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087205262] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:09,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:09,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:30:09,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215080075] [2022-11-20 10:30:09,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:09,486 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 10:30:09,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:09,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:30:09,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:30:09,487 INFO L87 Difference]: Start difference. First operand 342 states and 542 transitions. cyclomatic complexity: 208 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:09,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:09,527 INFO L93 Difference]: Finished difference Result 674 states and 1058 transitions. [2022-11-20 10:30:09,528 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 674 states and 1058 transitions. [2022-11-20 10:30:09,534 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2022-11-20 10:30:09,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 674 states to 674 states and 1058 transitions. [2022-11-20 10:30:09,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 674 [2022-11-20 10:30:09,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 674 [2022-11-20 10:30:09,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 674 states and 1058 transitions. [2022-11-20 10:30:09,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:30:09,553 INFO L218 hiAutomatonCegarLoop]: Abstraction has 674 states and 1058 transitions. [2022-11-20 10:30:09,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states and 1058 transitions. [2022-11-20 10:30:09,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2022-11-20 10:30:09,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 674 states have (on average 1.5697329376854599) internal successors, (1058), 673 states have internal predecessors, (1058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:09,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1058 transitions. [2022-11-20 10:30:09,586 INFO L240 hiAutomatonCegarLoop]: Abstraction has 674 states and 1058 transitions. [2022-11-20 10:30:09,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:30:09,600 INFO L428 stractBuchiCegarLoop]: Abstraction has 674 states and 1058 transitions. [2022-11-20 10:30:09,600 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-20 10:30:09,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 674 states and 1058 transitions. [2022-11-20 10:30:09,604 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2022-11-20 10:30:09,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:30:09,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:30:09,606 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 10:30:09,606 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, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:09,606 INFO L748 eck$LassoCheckResult]: Stem: 2005#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 1986#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 1987#L211-1 [2022-11-20 10:30:09,607 INFO L750 eck$LassoCheckResult]: Loop: 1987#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 2105#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 2103#L88 assume !(0 != main_~p1~0#1); 2104#L88-2 assume !(0 != main_~p2~0#1); 2147#L92-1 assume !(0 != main_~p3~0#1); 2145#L96-1 assume !(0 != main_~p4~0#1); 2143#L100-1 assume !(0 != main_~p5~0#1); 2142#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 2141#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2140#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2139#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 2138#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 2137#L124-1 assume !(0 != main_~p11~0#1); 2136#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 2135#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 2134#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 2132#L140-1 assume !(0 != main_~p1~0#1); 2130#L146-1 assume !(0 != main_~p2~0#1); 2129#L151-1 assume !(0 != main_~p3~0#1); 2126#L156-1 assume !(0 != main_~p4~0#1); 2124#L161-1 assume !(0 != main_~p5~0#1); 2123#L166-1 assume !(0 != main_~p6~0#1); 2120#L171-1 assume !(0 != main_~p7~0#1); 2119#L176-1 assume !(0 != main_~p8~0#1); 2117#L181-1 assume !(0 != main_~p9~0#1); 2114#L186-1 assume !(0 != main_~p10~0#1); 2113#L191-1 assume !(0 != main_~p11~0#1); 2111#L196-1 assume !(0 != main_~p12~0#1); 2109#L201-1 assume !(0 != main_~p13~0#1); 2107#L206-1 assume !(0 != main_~p14~0#1); 1987#L211-1 [2022-11-20 10:30:09,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:09,608 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-11-20 10:30:09,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:09,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499387775] [2022-11-20 10:30:09,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:09,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:09,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:30:09,615 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:30:09,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:30:09,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:30:09,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:09,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1653246343, now seen corresponding path program 1 times [2022-11-20 10:30:09,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:09,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034671076] [2022-11-20 10:30:09,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:09,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:09,718 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-20 10:30:09,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:09,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034671076] [2022-11-20 10:30:09,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034671076] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:09,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:09,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:30:09,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011025866] [2022-11-20 10:30:09,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:09,722 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 10:30:09,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:09,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:30:09,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:30:09,725 INFO L87 Difference]: Start difference. First operand 674 states and 1058 transitions. cyclomatic complexity: 400 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:09,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:09,752 INFO L93 Difference]: Finished difference Result 1330 states and 2066 transitions. [2022-11-20 10:30:09,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1330 states and 2066 transitions. [2022-11-20 10:30:09,765 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2022-11-20 10:30:09,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1330 states to 1330 states and 2066 transitions. [2022-11-20 10:30:09,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1330 [2022-11-20 10:30:09,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1330 [2022-11-20 10:30:09,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1330 states and 2066 transitions. [2022-11-20 10:30:09,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:30:09,778 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1330 states and 2066 transitions. [2022-11-20 10:30:09,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states and 2066 transitions. [2022-11-20 10:30:09,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2022-11-20 10:30:09,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1330 states have (on average 1.5533834586466166) internal successors, (2066), 1329 states have internal predecessors, (2066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:09,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 2066 transitions. [2022-11-20 10:30:09,813 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1330 states and 2066 transitions. [2022-11-20 10:30:09,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:30:09,818 INFO L428 stractBuchiCegarLoop]: Abstraction has 1330 states and 2066 transitions. [2022-11-20 10:30:09,818 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-20 10:30:09,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1330 states and 2066 transitions. [2022-11-20 10:30:09,827 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2022-11-20 10:30:09,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:30:09,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:30:09,830 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 10:30:09,830 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:09,830 INFO L748 eck$LassoCheckResult]: Stem: 4017#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 3996#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 3997#L211-1 [2022-11-20 10:30:09,830 INFO L750 eck$LassoCheckResult]: Loop: 3997#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 4074#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 4061#L88 assume !(0 != main_~p1~0#1); 4054#L88-2 assume !(0 != main_~p2~0#1); 4055#L92-1 assume !(0 != main_~p3~0#1); 4048#L96-1 assume !(0 != main_~p4~0#1); 4050#L100-1 assume !(0 != main_~p5~0#1); 4187#L104-1 assume !(0 != main_~p6~0#1); 4189#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 4179#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4180#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 4171#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 4172#L124-1 assume !(0 != main_~p11~0#1); 4163#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 4164#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 4155#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 4156#L140-1 assume !(0 != main_~p1~0#1); 4355#L146-1 assume !(0 != main_~p2~0#1); 4353#L151-1 assume !(0 != main_~p3~0#1); 4348#L156-1 assume !(0 != main_~p4~0#1); 4346#L161-1 assume !(0 != main_~p5~0#1); 4345#L166-1 assume !(0 != main_~p6~0#1); 4342#L171-1 assume !(0 != main_~p7~0#1); 4341#L176-1 assume !(0 != main_~p8~0#1); 4338#L181-1 assume !(0 != main_~p9~0#1); 4335#L186-1 assume !(0 != main_~p10~0#1); 4317#L191-1 assume !(0 != main_~p11~0#1); 4289#L196-1 assume !(0 != main_~p12~0#1); 4288#L201-1 assume !(0 != main_~p13~0#1); 4292#L206-1 assume !(0 != main_~p14~0#1); 3997#L211-1 [2022-11-20 10:30:09,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:09,832 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-11-20 10:30:09,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:09,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796832358] [2022-11-20 10:30:09,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:09,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:30:09,844 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:30:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:30:09,859 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:30:09,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:09,860 INFO L85 PathProgramCache]: Analyzing trace with hash 836282619, now seen corresponding path program 1 times [2022-11-20 10:30:09,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:09,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317168559] [2022-11-20 10:30:09,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:09,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:09,920 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-20 10:30:09,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:09,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317168559] [2022-11-20 10:30:09,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317168559] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:09,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:09,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:30:09,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295698470] [2022-11-20 10:30:09,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:09,922 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 10:30:09,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:09,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:30:09,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:30:09,924 INFO L87 Difference]: Start difference. First operand 1330 states and 2066 transitions. cyclomatic complexity: 768 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:09,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:09,961 INFO L93 Difference]: Finished difference Result 2626 states and 4034 transitions. [2022-11-20 10:30:09,962 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2626 states and 4034 transitions. [2022-11-20 10:30:09,993 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2022-11-20 10:30:10,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2626 states to 2626 states and 4034 transitions. [2022-11-20 10:30:10,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2626 [2022-11-20 10:30:10,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2626 [2022-11-20 10:30:10,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2626 states and 4034 transitions. [2022-11-20 10:30:10,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:30:10,014 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2626 states and 4034 transitions. [2022-11-20 10:30:10,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2626 states and 4034 transitions. [2022-11-20 10:30:10,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2626 to 2626. [2022-11-20 10:30:10,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2626 states, 2626 states have (on average 1.5361766945925361) internal successors, (4034), 2625 states have internal predecessors, (4034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:10,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 4034 transitions. [2022-11-20 10:30:10,074 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2626 states and 4034 transitions. [2022-11-20 10:30:10,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:30:10,076 INFO L428 stractBuchiCegarLoop]: Abstraction has 2626 states and 4034 transitions. [2022-11-20 10:30:10,076 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-11-20 10:30:10,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2626 states and 4034 transitions. [2022-11-20 10:30:10,091 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2022-11-20 10:30:10,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:30:10,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:30:10,093 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 10:30:10,094 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, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:10,095 INFO L748 eck$LassoCheckResult]: Stem: 7974#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 7958#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 7959#L211-1 [2022-11-20 10:30:10,095 INFO L750 eck$LassoCheckResult]: Loop: 7959#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 8097#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 8093#L88 assume !(0 != main_~p1~0#1); 8086#L88-2 assume !(0 != main_~p2~0#1); 8081#L92-1 assume !(0 != main_~p3~0#1); 8074#L96-1 assume !(0 != main_~p4~0#1); 8066#L100-1 assume !(0 != main_~p5~0#1); 8058#L104-1 assume !(0 != main_~p6~0#1); 8052#L108-1 assume !(0 != main_~p7~0#1); 8047#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 8048#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 8041#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 8042#L124-1 assume !(0 != main_~p11~0#1); 8035#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 8036#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 8028#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 8029#L140-1 assume !(0 != main_~p1~0#1); 8194#L146-1 assume !(0 != main_~p2~0#1); 8174#L151-1 assume !(0 != main_~p3~0#1); 8168#L156-1 assume !(0 != main_~p4~0#1); 8163#L161-1 assume !(0 != main_~p5~0#1); 8159#L166-1 assume !(0 != main_~p6~0#1); 8157#L171-1 assume !(0 != main_~p7~0#1); 8156#L176-1 assume !(0 != main_~p8~0#1); 8154#L181-1 assume !(0 != main_~p9~0#1); 8141#L186-1 assume !(0 != main_~p10~0#1); 8122#L191-1 assume !(0 != main_~p11~0#1); 8118#L196-1 assume !(0 != main_~p12~0#1); 8116#L201-1 assume !(0 != main_~p13~0#1); 8106#L206-1 assume !(0 != main_~p14~0#1); 7959#L211-1 [2022-11-20 10:30:10,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:10,098 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2022-11-20 10:30:10,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:10,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040984359] [2022-11-20 10:30:10,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:10,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:10,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:30:10,106 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:30:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:30:10,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:30:10,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:10,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1055137337, now seen corresponding path program 1 times [2022-11-20 10:30:10,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:10,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23307157] [2022-11-20 10:30:10,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:10,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:10,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:10,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-20 10:30:10,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:10,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23307157] [2022-11-20 10:30:10,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23307157] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:10,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:10,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:30:10,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033219540] [2022-11-20 10:30:10,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:10,172 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 10:30:10,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:10,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:30:10,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:30:10,173 INFO L87 Difference]: Start difference. First operand 2626 states and 4034 transitions. cyclomatic complexity: 1472 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:10,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:10,211 INFO L93 Difference]: Finished difference Result 5186 states and 7874 transitions. [2022-11-20 10:30:10,211 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5186 states and 7874 transitions. [2022-11-20 10:30:10,309 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2022-11-20 10:30:10,332 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5186 states to 5186 states and 7874 transitions. [2022-11-20 10:30:10,332 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5186 [2022-11-20 10:30:10,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5186 [2022-11-20 10:30:10,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5186 states and 7874 transitions. [2022-11-20 10:30:10,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:30:10,343 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5186 states and 7874 transitions. [2022-11-20 10:30:10,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5186 states and 7874 transitions. [2022-11-20 10:30:10,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5186 to 5186. [2022-11-20 10:30:10,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5186 states, 5186 states have (on average 1.5183185499421519) internal successors, (7874), 5185 states have internal predecessors, (7874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:10,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5186 states to 5186 states and 7874 transitions. [2022-11-20 10:30:10,458 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5186 states and 7874 transitions. [2022-11-20 10:30:10,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:30:10,461 INFO L428 stractBuchiCegarLoop]: Abstraction has 5186 states and 7874 transitions. [2022-11-20 10:30:10,461 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-11-20 10:30:10,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5186 states and 7874 transitions. [2022-11-20 10:30:10,487 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2022-11-20 10:30:10,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:30:10,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:30:10,490 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 10:30:10,490 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, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:10,490 INFO L748 eck$LassoCheckResult]: Stem: 15796#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 15777#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 15778#L211-1 [2022-11-20 10:30:10,491 INFO L750 eck$LassoCheckResult]: Loop: 15778#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 16332#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 16329#L88 assume !(0 != main_~p1~0#1); 16326#L88-2 assume !(0 != main_~p2~0#1); 16324#L92-1 assume !(0 != main_~p3~0#1); 16321#L96-1 assume !(0 != main_~p4~0#1); 16317#L100-1 assume !(0 != main_~p5~0#1); 16314#L104-1 assume !(0 != main_~p6~0#1); 16311#L108-1 assume !(0 != main_~p7~0#1); 16140#L112-1 assume !(0 != main_~p8~0#1); 16142#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 16090#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 16091#L124-1 assume !(0 != main_~p11~0#1); 16082#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 16083#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 16481#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 16477#L140-1 assume !(0 != main_~p1~0#1); 16066#L146-1 assume !(0 != main_~p2~0#1); 16068#L151-1 assume !(0 != main_~p3~0#1); 16057#L156-1 assume !(0 != main_~p4~0#1); 16059#L161-1 assume !(0 != main_~p5~0#1); 16363#L166-1 assume !(0 != main_~p6~0#1); 16361#L171-1 assume !(0 != main_~p7~0#1); 16359#L176-1 assume !(0 != main_~p8~0#1); 16357#L181-1 assume !(0 != main_~p9~0#1); 16352#L186-1 assume !(0 != main_~p10~0#1); 16349#L191-1 assume !(0 != main_~p11~0#1); 16345#L196-1 assume !(0 != main_~p12~0#1); 16341#L201-1 assume !(0 != main_~p13~0#1); 16337#L206-1 assume !(0 != main_~p14~0#1); 15778#L211-1 [2022-11-20 10:30:10,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:10,491 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2022-11-20 10:30:10,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:10,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583534744] [2022-11-20 10:30:10,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:10,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:30:10,498 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:30:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:30:10,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:30:10,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:10,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1477839163, now seen corresponding path program 1 times [2022-11-20 10:30:10,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:10,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331031152] [2022-11-20 10:30:10,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:10,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:10,549 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-20 10:30:10,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:10,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331031152] [2022-11-20 10:30:10,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331031152] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:10,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:10,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:30:10,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256278484] [2022-11-20 10:30:10,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:10,551 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 10:30:10,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:10,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:30:10,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:30:10,552 INFO L87 Difference]: Start difference. First operand 5186 states and 7874 transitions. cyclomatic complexity: 2816 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:10,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:10,606 INFO L93 Difference]: Finished difference Result 10242 states and 15362 transitions. [2022-11-20 10:30:10,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10242 states and 15362 transitions. [2022-11-20 10:30:10,749 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2022-11-20 10:30:10,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10242 states to 10242 states and 15362 transitions. [2022-11-20 10:30:10,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10242 [2022-11-20 10:30:10,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10242 [2022-11-20 10:30:10,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10242 states and 15362 transitions. [2022-11-20 10:30:10,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:30:10,834 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10242 states and 15362 transitions. [2022-11-20 10:30:10,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10242 states and 15362 transitions. [2022-11-20 10:30:11,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10242 to 10242. [2022-11-20 10:30:11,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10242 states, 10242 states have (on average 1.4999023628197619) internal successors, (15362), 10241 states have internal predecessors, (15362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:11,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10242 states to 10242 states and 15362 transitions. [2022-11-20 10:30:11,120 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10242 states and 15362 transitions. [2022-11-20 10:30:11,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:30:11,123 INFO L428 stractBuchiCegarLoop]: Abstraction has 10242 states and 15362 transitions. [2022-11-20 10:30:11,123 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-11-20 10:30:11,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10242 states and 15362 transitions. [2022-11-20 10:30:11,170 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2022-11-20 10:30:11,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:30:11,170 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:30:11,171 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 10:30:11,171 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, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:11,171 INFO L748 eck$LassoCheckResult]: Stem: 31228#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 31211#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 31212#L211-1 [2022-11-20 10:30:11,173 INFO L750 eck$LassoCheckResult]: Loop: 31212#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 31931#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 31927#L88 assume !(0 != main_~p1~0#1); 31923#L88-2 assume !(0 != main_~p2~0#1); 31921#L92-1 assume !(0 != main_~p3~0#1); 31917#L96-1 assume !(0 != main_~p4~0#1); 31913#L100-1 assume !(0 != main_~p5~0#1); 31910#L104-1 assume !(0 != main_~p6~0#1); 31911#L108-1 assume !(0 != main_~p7~0#1); 31996#L112-1 assume !(0 != main_~p8~0#1); 31993#L116-1 assume !(0 != main_~p9~0#1); 31991#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 31989#L124-1 assume !(0 != main_~p11~0#1); 31987#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 31985#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 31982#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 31978#L140-1 assume !(0 != main_~p1~0#1); 31974#L146-1 assume !(0 != main_~p2~0#1); 31972#L151-1 assume !(0 != main_~p3~0#1); 31968#L156-1 assume !(0 != main_~p4~0#1); 31965#L161-1 assume !(0 != main_~p5~0#1); 31964#L166-1 assume !(0 != main_~p6~0#1); 31962#L171-1 assume !(0 != main_~p7~0#1); 31958#L176-1 assume !(0 != main_~p8~0#1); 31954#L181-1 assume !(0 != main_~p9~0#1); 31950#L186-1 assume !(0 != main_~p10~0#1); 31947#L191-1 assume !(0 != main_~p11~0#1); 31943#L196-1 assume !(0 != main_~p12~0#1); 31939#L201-1 assume !(0 != main_~p13~0#1); 31935#L206-1 assume !(0 != main_~p14~0#1); 31212#L211-1 [2022-11-20 10:30:11,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:11,174 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2022-11-20 10:30:11,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:11,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138698211] [2022-11-20 10:30:11,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:11,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:30:11,186 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:30:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:30:11,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:30:11,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:11,195 INFO L85 PathProgramCache]: Analyzing trace with hash 660190713, now seen corresponding path program 1 times [2022-11-20 10:30:11,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:11,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383618742] [2022-11-20 10:30:11,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:11,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:11,255 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-20 10:30:11,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:11,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383618742] [2022-11-20 10:30:11,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383618742] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:11,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:11,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:30:11,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119828197] [2022-11-20 10:30:11,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:11,258 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 10:30:11,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:11,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:30:11,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:30:11,259 INFO L87 Difference]: Start difference. First operand 10242 states and 15362 transitions. cyclomatic complexity: 5376 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:11,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:11,345 INFO L93 Difference]: Finished difference Result 20226 states and 29954 transitions. [2022-11-20 10:30:11,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20226 states and 29954 transitions. [2022-11-20 10:30:11,626 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2022-11-20 10:30:11,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20226 states to 20226 states and 29954 transitions. [2022-11-20 10:30:11,703 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20226 [2022-11-20 10:30:11,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20226 [2022-11-20 10:30:11,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20226 states and 29954 transitions. [2022-11-20 10:30:11,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:30:11,742 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20226 states and 29954 transitions. [2022-11-20 10:30:11,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20226 states and 29954 transitions. [2022-11-20 10:30:12,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20226 to 20226. [2022-11-20 10:30:12,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20226 states, 20226 states have (on average 1.4809650944329082) internal successors, (29954), 20225 states have internal predecessors, (29954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:12,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20226 states to 20226 states and 29954 transitions. [2022-11-20 10:30:12,363 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20226 states and 29954 transitions. [2022-11-20 10:30:12,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:30:12,368 INFO L428 stractBuchiCegarLoop]: Abstraction has 20226 states and 29954 transitions. [2022-11-20 10:30:12,368 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-11-20 10:30:12,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20226 states and 29954 transitions. [2022-11-20 10:30:12,481 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2022-11-20 10:30:12,482 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:30:12,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:30:12,482 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 10:30:12,482 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, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:12,483 INFO L748 eck$LassoCheckResult]: Stem: 61703#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 61684#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 61685#L211-1 [2022-11-20 10:30:12,483 INFO L750 eck$LassoCheckResult]: Loop: 61685#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 62023#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 62020#L88 assume !(0 != main_~p1~0#1); 62016#L88-2 assume !(0 != main_~p2~0#1); 62013#L92-1 assume !(0 != main_~p3~0#1); 62010#L96-1 assume !(0 != main_~p4~0#1); 62006#L100-1 assume !(0 != main_~p5~0#1); 62002#L104-1 assume !(0 != main_~p6~0#1); 61995#L108-1 assume !(0 != main_~p7~0#1); 61996#L112-1 assume !(0 != main_~p8~0#1); 62085#L116-1 assume !(0 != main_~p9~0#1); 62081#L120-1 assume !(0 != main_~p10~0#1); 62079#L124-1 assume !(0 != main_~p11~0#1); 62077#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 62075#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 62073#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 62069#L140-1 assume !(0 != main_~p1~0#1); 62065#L146-1 assume !(0 != main_~p2~0#1); 62062#L151-1 assume !(0 != main_~p3~0#1); 62057#L156-1 assume !(0 != main_~p4~0#1); 62053#L161-1 assume !(0 != main_~p5~0#1); 62049#L166-1 assume !(0 != main_~p6~0#1); 62047#L171-1 assume !(0 != main_~p7~0#1); 62045#L176-1 assume !(0 != main_~p8~0#1); 62043#L181-1 assume !(0 != main_~p9~0#1); 62041#L186-1 assume !(0 != main_~p10~0#1); 62040#L191-1 assume !(0 != main_~p11~0#1); 62036#L196-1 assume !(0 != main_~p12~0#1); 62032#L201-1 assume !(0 != main_~p13~0#1); 62028#L206-1 assume !(0 != main_~p14~0#1); 61685#L211-1 [2022-11-20 10:30:12,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:12,484 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2022-11-20 10:30:12,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:12,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453301462] [2022-11-20 10:30:12,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:12,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:12,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:30:12,507 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:30:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:30:12,519 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:30:12,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:12,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1028753029, now seen corresponding path program 1 times [2022-11-20 10:30:12,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:12,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295609983] [2022-11-20 10:30:12,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:12,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:12,571 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-20 10:30:12,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:12,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295609983] [2022-11-20 10:30:12,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295609983] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:12,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:12,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:30:12,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156573282] [2022-11-20 10:30:12,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:12,576 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 10:30:12,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:12,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:30:12,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:30:12,587 INFO L87 Difference]: Start difference. First operand 20226 states and 29954 transitions. cyclomatic complexity: 10240 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:12,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:12,986 INFO L93 Difference]: Finished difference Result 39938 states and 58370 transitions. [2022-11-20 10:30:12,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39938 states and 58370 transitions. [2022-11-20 10:30:13,299 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2022-11-20 10:30:13,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39938 states to 39938 states and 58370 transitions. [2022-11-20 10:30:13,433 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39938 [2022-11-20 10:30:13,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39938 [2022-11-20 10:30:13,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39938 states and 58370 transitions. [2022-11-20 10:30:13,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:30:13,482 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39938 states and 58370 transitions. [2022-11-20 10:30:13,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39938 states and 58370 transitions. [2022-11-20 10:30:14,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39938 to 39938. [2022-11-20 10:30:14,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39938 states, 39938 states have (on average 1.4615153487906254) internal successors, (58370), 39937 states have internal predecessors, (58370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:14,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39938 states to 39938 states and 58370 transitions. [2022-11-20 10:30:14,319 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39938 states and 58370 transitions. [2022-11-20 10:30:14,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:30:14,320 INFO L428 stractBuchiCegarLoop]: Abstraction has 39938 states and 58370 transitions. [2022-11-20 10:30:14,320 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-11-20 10:30:14,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39938 states and 58370 transitions. [2022-11-20 10:30:14,560 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2022-11-20 10:30:14,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:30:14,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:30:14,562 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 10:30:14,562 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:14,562 INFO L748 eck$LassoCheckResult]: Stem: 121875#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 121856#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 121857#L211-1 [2022-11-20 10:30:14,562 INFO L750 eck$LassoCheckResult]: Loop: 121857#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 122012#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 122010#L88 assume !(0 != main_~p1~0#1); 122006#L88-2 assume !(0 != main_~p2~0#1); 122004#L92-1 assume !(0 != main_~p3~0#1); 122000#L96-1 assume !(0 != main_~p4~0#1); 121996#L100-1 assume !(0 != main_~p5~0#1); 121992#L104-1 assume !(0 != main_~p6~0#1); 121988#L108-1 assume !(0 != main_~p7~0#1); 121984#L112-1 assume !(0 != main_~p8~0#1); 121980#L116-1 assume !(0 != main_~p9~0#1); 121976#L120-1 assume !(0 != main_~p10~0#1); 121974#L124-1 assume !(0 != main_~p11~0#1); 121970#L128-1 assume !(0 != main_~p12~0#1); 121968#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 121966#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 121963#L140-1 assume !(0 != main_~p1~0#1); 121964#L146-1 assume !(0 != main_~p2~0#1); 122060#L151-1 assume !(0 != main_~p3~0#1); 122055#L156-1 assume !(0 != main_~p4~0#1); 122051#L161-1 assume !(0 != main_~p5~0#1); 122047#L166-1 assume !(0 != main_~p6~0#1); 122043#L171-1 assume !(0 != main_~p7~0#1); 122039#L176-1 assume !(0 != main_~p8~0#1); 122035#L181-1 assume !(0 != main_~p9~0#1); 122031#L186-1 assume !(0 != main_~p10~0#1); 122028#L191-1 assume !(0 != main_~p11~0#1); 122023#L196-1 assume !(0 != main_~p12~0#1); 122020#L201-1 assume !(0 != main_~p13~0#1); 122016#L206-1 assume !(0 != main_~p14~0#1); 121857#L211-1 [2022-11-20 10:30:14,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:14,563 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2022-11-20 10:30:14,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:14,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756880904] [2022-11-20 10:30:14,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:14,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:30:14,570 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:30:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:30:14,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:30:14,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:14,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1677866365, now seen corresponding path program 1 times [2022-11-20 10:30:14,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:14,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102692251] [2022-11-20 10:30:14,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:14,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:14,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:14,612 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-20 10:30:14,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:14,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102692251] [2022-11-20 10:30:14,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102692251] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:14,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:14,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:30:14,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346978440] [2022-11-20 10:30:14,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:14,614 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 10:30:14,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:14,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:30:14,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:30:14,616 INFO L87 Difference]: Start difference. First operand 39938 states and 58370 transitions. cyclomatic complexity: 19456 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:14,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:14,964 INFO L93 Difference]: Finished difference Result 78850 states and 113666 transitions. [2022-11-20 10:30:14,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78850 states and 113666 transitions. [2022-11-20 10:30:15,554 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 78848 [2022-11-20 10:30:16,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78850 states to 78850 states and 113666 transitions. [2022-11-20 10:30:16,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78850 [2022-11-20 10:30:16,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78850 [2022-11-20 10:30:16,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78850 states and 113666 transitions. [2022-11-20 10:30:16,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:30:16,135 INFO L218 hiAutomatonCegarLoop]: Abstraction has 78850 states and 113666 transitions. [2022-11-20 10:30:16,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78850 states and 113666 transitions. [2022-11-20 10:30:16,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78850 to 78850. [2022-11-20 10:30:17,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78850 states, 78850 states have (on average 1.4415472415979709) internal successors, (113666), 78849 states have internal predecessors, (113666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:17,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78850 states to 78850 states and 113666 transitions. [2022-11-20 10:30:17,498 INFO L240 hiAutomatonCegarLoop]: Abstraction has 78850 states and 113666 transitions. [2022-11-20 10:30:17,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:30:17,501 INFO L428 stractBuchiCegarLoop]: Abstraction has 78850 states and 113666 transitions. [2022-11-20 10:30:17,501 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-11-20 10:30:17,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78850 states and 113666 transitions. [2022-11-20 10:30:17,706 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 78848 [2022-11-20 10:30:17,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:30:17,707 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:30:17,708 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 10:30:17,708 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, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:17,708 INFO L748 eck$LassoCheckResult]: Stem: 240669#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 240648#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 240649#L211-1 [2022-11-20 10:30:17,708 INFO L750 eck$LassoCheckResult]: Loop: 240649#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 241123#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 241119#L88 assume !(0 != main_~p1~0#1); 241113#L88-2 assume !(0 != main_~p2~0#1); 241108#L92-1 assume !(0 != main_~p3~0#1); 241104#L96-1 assume !(0 != main_~p4~0#1); 241098#L100-1 assume !(0 != main_~p5~0#1); 241068#L104-1 assume !(0 != main_~p6~0#1); 241070#L108-1 assume !(0 != main_~p7~0#1); 241092#L112-1 assume !(0 != main_~p8~0#1); 241206#L116-1 assume !(0 != main_~p9~0#1); 241203#L120-1 assume !(0 != main_~p10~0#1); 241200#L124-1 assume !(0 != main_~p11~0#1); 241197#L128-1 assume !(0 != main_~p12~0#1); 241193#L132-1 assume !(0 != main_~p13~0#1); 241194#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 241224#L140-1 assume !(0 != main_~p1~0#1); 241222#L146-1 assume !(0 != main_~p2~0#1); 241221#L151-1 assume !(0 != main_~p3~0#1); 241218#L156-1 assume !(0 != main_~p4~0#1); 241216#L161-1 assume !(0 != main_~p5~0#1); 241214#L166-1 assume !(0 != main_~p6~0#1); 241007#L171-1 assume !(0 != main_~p7~0#1); 241002#L176-1 assume !(0 != main_~p8~0#1); 240997#L181-1 assume !(0 != main_~p9~0#1); 240992#L186-1 assume !(0 != main_~p10~0#1); 240993#L191-1 assume !(0 != main_~p11~0#1); 240982#L196-1 assume !(0 != main_~p12~0#1); 240984#L201-1 assume !(0 != main_~p13~0#1); 241131#L206-1 assume !(0 != main_~p14~0#1); 240649#L211-1 [2022-11-20 10:30:17,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:17,709 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2022-11-20 10:30:17,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:17,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845094671] [2022-11-20 10:30:17,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:17,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:30:17,714 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:30:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:30:17,718 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:30:17,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:17,719 INFO L85 PathProgramCache]: Analyzing trace with hash 656798011, now seen corresponding path program 1 times [2022-11-20 10:30:17,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:17,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406858152] [2022-11-20 10:30:17,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:17,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:17,747 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-20 10:30:17,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:17,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406858152] [2022-11-20 10:30:17,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406858152] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:17,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:17,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:30:17,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851928869] [2022-11-20 10:30:17,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:17,751 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 10:30:17,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:17,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:30:17,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:30:17,752 INFO L87 Difference]: Start difference. First operand 78850 states and 113666 transitions. cyclomatic complexity: 36864 Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:18,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:18,283 INFO L93 Difference]: Finished difference Result 155650 states and 221186 transitions. [2022-11-20 10:30:18,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155650 states and 221186 transitions. [2022-11-20 10:30:19,354 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 155648 [2022-11-20 10:30:19,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155650 states to 155650 states and 221186 transitions. [2022-11-20 10:30:19,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155650 [2022-11-20 10:30:19,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155650 [2022-11-20 10:30:19,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155650 states and 221186 transitions. [2022-11-20 10:30:19,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:30:19,947 INFO L218 hiAutomatonCegarLoop]: Abstraction has 155650 states and 221186 transitions. [2022-11-20 10:30:20,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155650 states and 221186 transitions. [2022-11-20 10:30:21,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155650 to 155650. [2022-11-20 10:30:21,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155650 states, 155650 states have (on average 1.4210472213299068) internal successors, (221186), 155649 states have internal predecessors, (221186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:22,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155650 states to 155650 states and 221186 transitions. [2022-11-20 10:30:22,684 INFO L240 hiAutomatonCegarLoop]: Abstraction has 155650 states and 221186 transitions. [2022-11-20 10:30:22,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:30:22,685 INFO L428 stractBuchiCegarLoop]: Abstraction has 155650 states and 221186 transitions. [2022-11-20 10:30:22,685 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-11-20 10:30:22,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 155650 states and 221186 transitions. [2022-11-20 10:30:23,159 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 155648 [2022-11-20 10:30:23,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:30:23,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:30:23,160 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 10:30:23,161 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, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:23,161 INFO L748 eck$LassoCheckResult]: Stem: 475174#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 475155#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 475156#L211-1 [2022-11-20 10:30:23,161 INFO L750 eck$LassoCheckResult]: Loop: 475156#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 476630#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 476626#L88 assume !(0 != main_~p1~0#1); 476622#L88-2 assume !(0 != main_~p2~0#1); 476620#L92-1 assume !(0 != main_~p3~0#1); 476615#L96-1 assume !(0 != main_~p4~0#1); 476603#L100-1 assume !(0 != main_~p5~0#1); 476604#L104-1 assume !(0 != main_~p6~0#1); 476674#L108-1 assume !(0 != main_~p7~0#1); 476661#L112-1 assume !(0 != main_~p8~0#1); 476659#L116-1 assume !(0 != main_~p9~0#1); 476569#L120-1 assume !(0 != main_~p10~0#1); 476571#L124-1 assume !(0 != main_~p11~0#1); 476544#L128-1 assume !(0 != main_~p12~0#1); 476546#L132-1 assume !(0 != main_~p13~0#1); 476521#L136-1 assume !(0 != main_~p14~0#1); 476523#L140-1 assume !(0 != main_~p1~0#1); 476485#L146-1 assume !(0 != main_~p2~0#1); 476487#L151-1 assume !(0 != main_~p3~0#1); 476475#L156-1 assume !(0 != main_~p4~0#1); 476477#L161-1 assume !(0 != main_~p5~0#1); 476335#L166-1 assume !(0 != main_~p6~0#1); 476336#L171-1 assume !(0 != main_~p7~0#1); 476428#L176-1 assume !(0 != main_~p8~0#1); 476650#L181-1 assume !(0 != main_~p9~0#1); 476647#L186-1 assume !(0 != main_~p10~0#1); 476646#L191-1 assume !(0 != main_~p11~0#1); 476643#L196-1 assume !(0 != main_~p12~0#1); 476639#L201-1 assume !(0 != main_~p13~0#1); 476635#L206-1 assume !(0 != main_~p14~0#1); 475156#L211-1 [2022-11-20 10:30:23,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:23,162 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 13 times [2022-11-20 10:30:23,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:23,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490964967] [2022-11-20 10:30:23,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:23,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:23,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:30:23,168 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:30:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:30:23,173 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:30:23,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:23,174 INFO L85 PathProgramCache]: Analyzing trace with hash -623065667, now seen corresponding path program 1 times [2022-11-20 10:30:23,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:23,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011988298] [2022-11-20 10:30:23,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:23,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:23,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:30:23,182 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:30:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:30:23,192 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:30:23,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:23,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1839024639, now seen corresponding path program 1 times [2022-11-20 10:30:23,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:23,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848043193] [2022-11-20 10:30:23,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:23,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:30:23,201 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:30:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:30:23,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:30:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:30:23,831 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:30:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:30:23,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.11 10:30:23 BoogieIcfgContainer [2022-11-20 10:30:23,873 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-11-20 10:30:23,874 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:30:23,874 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:30:23,874 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:30:23,875 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:30:08" (3/4) ... [2022-11-20 10:30:23,878 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-11-20 10:30:23,918 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1af29db-8658-462f-85b4-933036004070/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 10:30:23,918 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:30:23,919 INFO L158 Benchmark]: Toolchain (without parser) took 16422.31ms. Allocated memory was 134.2MB in the beginning and 11.4GB in the end (delta: 11.3GB). Free memory was 89.4MB in the beginning and 9.9GB in the end (delta: -9.8GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2022-11-20 10:30:23,919 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 134.2MB. Free memory is still 76.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:30:23,920 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.35ms. Allocated memory is still 134.2MB. Free memory was 89.1MB in the beginning and 77.8MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-20 10:30:23,920 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.00ms. Allocated memory is still 134.2MB. Free memory was 77.8MB in the beginning and 76.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:30:23,920 INFO L158 Benchmark]: Boogie Preprocessor took 31.24ms. Allocated memory is still 134.2MB. Free memory was 76.2MB in the beginning and 74.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:30:23,921 INFO L158 Benchmark]: RCFGBuilder took 421.39ms. Allocated memory was 134.2MB in the beginning and 174.1MB in the end (delta: 39.8MB). Free memory was 74.3MB in the beginning and 136.3MB in the end (delta: -62.1MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2022-11-20 10:30:23,921 INFO L158 Benchmark]: BuchiAutomizer took 15620.94ms. Allocated memory was 174.1MB in the beginning and 11.4GB in the end (delta: 11.2GB). Free memory was 136.3MB in the beginning and 9.9GB in the end (delta: -9.8GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2022-11-20 10:30:23,922 INFO L158 Benchmark]: Witness Printer took 44.49ms. Allocated memory is still 11.4GB. Free memory was 9.9GB in the beginning and 9.9GB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 10:30:23,923 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.26ms. Allocated memory is still 134.2MB. Free memory is still 76.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.35ms. Allocated memory is still 134.2MB. Free memory was 89.1MB in the beginning and 77.8MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.00ms. Allocated memory is still 134.2MB. Free memory was 77.8MB in the beginning and 76.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.24ms. Allocated memory is still 134.2MB. Free memory was 76.2MB in the beginning and 74.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 421.39ms. Allocated memory was 134.2MB in the beginning and 174.1MB in the end (delta: 39.8MB). Free memory was 74.3MB in the beginning and 136.3MB in the end (delta: -62.1MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 15620.94ms. Allocated memory was 174.1MB in the beginning and 11.4GB in the end (delta: 11.2GB). Free memory was 136.3MB in the beginning and 9.9GB in the end (delta: -9.8GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 44.49ms. Allocated memory is still 11.4GB. Free memory was 9.9GB in the beginning and 9.9GB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (12 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.12 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 155650 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.5s and 13 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.1s. Büchi inclusion checks took 12.1s. Highest rank in rank-based complementation 0. Minimization of det autom 12. Minimization of nondet autom 0. Automata minimization 6.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 3.7s Buchi closure took 0.1s. 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, 690 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 690 mSDsluCounter, 2157 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 833 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 60 IncrementalHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 1324 mSDtfsCounter, 60 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI12 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 53]: 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; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L51] int cond; Loop: [L53] COND TRUE 1 [L54] cond = __VERIFIER_nondet_int() [L55] COND FALSE !(cond == 0) [L58] lk1 = 0 [L60] lk2 = 0 [L62] lk3 = 0 [L64] lk4 = 0 [L66] lk5 = 0 [L68] lk6 = 0 [L70] lk7 = 0 [L72] lk8 = 0 [L74] lk9 = 0 [L76] lk10 = 0 [L78] lk11 = 0 [L80] lk12 = 0 [L82] lk13 = 0 [L84] lk14 = 0 [L88] COND FALSE !(p1 != 0) [L92] COND FALSE !(p2 != 0) [L96] COND FALSE !(p3 != 0) [L100] COND FALSE !(p4 != 0) [L104] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L112] COND FALSE !(p7 != 0) [L116] COND FALSE !(p8 != 0) [L120] COND FALSE !(p9 != 0) [L124] COND FALSE !(p10 != 0) [L128] COND FALSE !(p11 != 0) [L132] COND FALSE !(p12 != 0) [L136] COND FALSE !(p13 != 0) [L140] COND FALSE !(p14 != 0) [L146] COND FALSE !(p1 != 0) [L151] COND FALSE !(p2 != 0) [L156] COND FALSE !(p3 != 0) [L161] COND FALSE !(p4 != 0) [L166] COND FALSE !(p5 != 0) [L171] COND FALSE !(p6 != 0) [L176] COND FALSE !(p7 != 0) [L181] COND FALSE !(p8 != 0) [L186] COND FALSE !(p9 != 0) [L191] COND FALSE !(p10 != 0) [L196] COND FALSE !(p11 != 0) [L201] COND FALSE !(p12 != 0) [L206] COND FALSE !(p13 != 0) [L211] COND FALSE !(p14 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 53]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L51] int cond; Loop: [L53] COND TRUE 1 [L54] cond = __VERIFIER_nondet_int() [L55] COND FALSE !(cond == 0) [L58] lk1 = 0 [L60] lk2 = 0 [L62] lk3 = 0 [L64] lk4 = 0 [L66] lk5 = 0 [L68] lk6 = 0 [L70] lk7 = 0 [L72] lk8 = 0 [L74] lk9 = 0 [L76] lk10 = 0 [L78] lk11 = 0 [L80] lk12 = 0 [L82] lk13 = 0 [L84] lk14 = 0 [L88] COND FALSE !(p1 != 0) [L92] COND FALSE !(p2 != 0) [L96] COND FALSE !(p3 != 0) [L100] COND FALSE !(p4 != 0) [L104] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L112] COND FALSE !(p7 != 0) [L116] COND FALSE !(p8 != 0) [L120] COND FALSE !(p9 != 0) [L124] COND FALSE !(p10 != 0) [L128] COND FALSE !(p11 != 0) [L132] COND FALSE !(p12 != 0) [L136] COND FALSE !(p13 != 0) [L140] COND FALSE !(p14 != 0) [L146] COND FALSE !(p1 != 0) [L151] COND FALSE !(p2 != 0) [L156] COND FALSE !(p3 != 0) [L161] COND FALSE !(p4 != 0) [L166] COND FALSE !(p5 != 0) [L171] COND FALSE !(p6 != 0) [L176] COND FALSE !(p7 != 0) [L181] COND FALSE !(p8 != 0) [L186] COND FALSE !(p9 != 0) [L191] COND FALSE !(p10 != 0) [L196] COND FALSE !(p11 != 0) [L201] COND FALSE !(p12 != 0) [L206] COND FALSE !(p13 != 0) [L211] COND FALSE !(p14 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-11-20 10:30:23,959 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1af29db-8658-462f-85b4-933036004070/bin/uautomizer-ug76WZFUDN/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)