./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_7.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd0b267c-5eb2-469d-ae56-84eb0c143765/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd0b267c-5eb2-469d-ae56-84eb0c143765/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd0b267c-5eb2-469d-ae56-84eb0c143765/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd0b267c-5eb2-469d-ae56-84eb0c143765/bin/uautomizer-uyxdKDjOR8/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_7.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd0b267c-5eb2-469d-ae56-84eb0c143765/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd0b267c-5eb2-469d-ae56-84eb0c143765/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 05c715fd95d2209519e9aa0425ca71b72050ac0ff5d332c8a9deb8ead8471230 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 20:28:36,103 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 20:28:36,105 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 20:28:36,119 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 20:28:36,119 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 20:28:36,119 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 20:28:36,120 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 20:28:36,121 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 20:28:36,122 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 20:28:36,123 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 20:28:36,123 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 20:28:36,124 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 20:28:36,124 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 20:28:36,125 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 20:28:36,125 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 20:28:36,126 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 20:28:36,127 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 20:28:36,127 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 20:28:36,128 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 20:28:36,129 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 20:28:36,130 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 20:28:36,131 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 20:28:36,132 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 20:28:36,133 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 20:28:36,135 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 20:28:36,135 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 20:28:36,135 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 20:28:36,136 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 20:28:36,136 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 20:28:36,137 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 20:28:36,137 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 20:28:36,137 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 20:28:36,138 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 20:28:36,138 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 20:28:36,139 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 20:28:36,139 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 20:28:36,139 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 20:28:36,140 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 20:28:36,140 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 20:28:36,140 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 20:28:36,141 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 20:28:36,142 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd0b267c-5eb2-469d-ae56-84eb0c143765/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-12-13 20:28:36,156 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 20:28:36,156 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 20:28:36,157 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 20:28:36,157 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 20:28:36,158 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 20:28:36,158 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 20:28:36,158 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 20:28:36,158 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-12-13 20:28:36,158 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-12-13 20:28:36,159 INFO L138 SettingsManager]: * Use old map elimination=false [2022-12-13 20:28:36,159 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-12-13 20:28:36,159 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-12-13 20:28:36,159 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-12-13 20:28:36,160 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 20:28:36,160 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 20:28:36,160 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 20:28:36,160 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 20:28:36,161 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 20:28:36,161 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 20:28:36,161 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-12-13 20:28:36,162 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-12-13 20:28:36,162 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-12-13 20:28:36,162 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 20:28:36,162 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 20:28:36,163 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-12-13 20:28:36,163 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 20:28:36,163 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-12-13 20:28:36,163 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 20:28:36,163 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 20:28:36,164 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 20:28:36,164 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 20:28:36,164 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-12-13 20:28:36,165 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_fd0b267c-5eb2-469d-ae56-84eb0c143765/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd0b267c-5eb2-469d-ae56-84eb0c143765/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 05c715fd95d2209519e9aa0425ca71b72050ac0ff5d332c8a9deb8ead8471230 [2022-12-13 20:28:36,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 20:28:36,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 20:28:36,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 20:28:36,358 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 20:28:36,358 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 20:28:36,359 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd0b267c-5eb2-469d-ae56-84eb0c143765/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/locks/test_locks_7.c [2022-12-13 20:28:38,920 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 20:28:39,077 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 20:28:39,077 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd0b267c-5eb2-469d-ae56-84eb0c143765/sv-benchmarks/c/locks/test_locks_7.c [2022-12-13 20:28:39,083 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd0b267c-5eb2-469d-ae56-84eb0c143765/bin/uautomizer-uyxdKDjOR8/data/35894d87f/153634406b0a47e39de9c55b0bf56ffa/FLAG6b0dda85c [2022-12-13 20:28:39,487 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd0b267c-5eb2-469d-ae56-84eb0c143765/bin/uautomizer-uyxdKDjOR8/data/35894d87f/153634406b0a47e39de9c55b0bf56ffa [2022-12-13 20:28:39,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 20:28:39,491 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 20:28:39,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 20:28:39,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 20:28:39,496 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 20:28:39,497 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:28:39" (1/1) ... [2022-12-13 20:28:39,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@136dcbcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:28:39, skipping insertion in model container [2022-12-13 20:28:39,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:28:39" (1/1) ... [2022-12-13 20:28:39,506 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 20:28:39,521 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 20:28:39,644 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_fd0b267c-5eb2-469d-ae56-84eb0c143765/sv-benchmarks/c/locks/test_locks_7.c[2881,2894] [2022-12-13 20:28:39,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:28:39,653 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 20:28:39,666 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_fd0b267c-5eb2-469d-ae56-84eb0c143765/sv-benchmarks/c/locks/test_locks_7.c[2881,2894] [2022-12-13 20:28:39,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:28:39,676 INFO L208 MainTranslator]: Completed translation [2022-12-13 20:28:39,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:28:39 WrapperNode [2022-12-13 20:28:39,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 20:28:39,678 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 20:28:39,678 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 20:28:39,678 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 20:28:39,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:28:39" (1/1) ... [2022-12-13 20:28:39,688 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:28:39" (1/1) ... [2022-12-13 20:28:39,700 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 97 [2022-12-13 20:28:39,701 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 20:28:39,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 20:28:39,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 20:28:39,701 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 20:28:39,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:28:39" (1/1) ... [2022-12-13 20:28:39,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:28:39" (1/1) ... [2022-12-13 20:28:39,709 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:28:39" (1/1) ... [2022-12-13 20:28:39,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:28:39" (1/1) ... [2022-12-13 20:28:39,711 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:28:39" (1/1) ... [2022-12-13 20:28:39,714 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:28:39" (1/1) ... [2022-12-13 20:28:39,714 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:28:39" (1/1) ... [2022-12-13 20:28:39,715 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:28:39" (1/1) ... [2022-12-13 20:28:39,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 20:28:39,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 20:28:39,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 20:28:39,717 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 20:28:39,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:28:39" (1/1) ... [2022-12-13 20:28:39,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 20:28:39,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd0b267c-5eb2-469d-ae56-84eb0c143765/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:28:39,741 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd0b267c-5eb2-469d-ae56-84eb0c143765/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 20:28:39,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd0b267c-5eb2-469d-ae56-84eb0c143765/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-12-13 20:28:39,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 20:28:39,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 20:28:39,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 20:28:39,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 20:28:39,836 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 20:28:39,837 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 20:28:39,933 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 20:28:39,937 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 20:28:39,937 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 20:28:39,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:28:39 BoogieIcfgContainer [2022-12-13 20:28:39,939 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 20:28:39,939 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-12-13 20:28:39,940 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-12-13 20:28:39,942 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-12-13 20:28:39,943 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 20:28:39,943 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.12 08:28:39" (1/3) ... [2022-12-13 20:28:39,943 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b03c8b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 08:28:39, skipping insertion in model container [2022-12-13 20:28:39,943 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 20:28:39,943 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:28:39" (2/3) ... [2022-12-13 20:28:39,944 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b03c8b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 08:28:39, skipping insertion in model container [2022-12-13 20:28:39,944 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 20:28:39,944 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:28:39" (3/3) ... [2022-12-13 20:28:39,945 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_7.c [2022-12-13 20:28:39,982 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-12-13 20:28:39,982 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-12-13 20:28:39,982 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-12-13 20:28:39,982 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-12-13 20:28:39,982 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-12-13 20:28:39,982 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-12-13 20:28:39,982 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-12-13 20:28:39,982 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-12-13 20:28:39,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 29 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:28:39,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2022-12-13 20:28:39,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 20:28:39,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 20:28:40,003 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 20:28:40,003 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:28:40,003 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-12-13 20:28:40,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 29 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:28:40,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2022-12-13 20:28:40,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 20:28:40,005 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 20:28:40,005 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 20:28:40,005 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:28:40,011 INFO L748 eck$LassoCheckResult]: Stem: 28#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 5#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_~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_~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;havoc main_~cond~0#1; 17#L113-1true [2022-12-13 20:28:40,011 INFO L750 eck$LassoCheckResult]: Loop: 17#L113-1true assume !false;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 26#L34true 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; 29#L53true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 3#L53-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 13#L57-1true assume !(0 != main_~p3~0#1); 9#L61-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 24#L65-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 25#L69-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 11#L73-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 23#L77-1true assume !(0 != main_~p1~0#1); 30#L83-1true assume !(0 != main_~p2~0#1); 15#L88-1true assume !(0 != main_~p3~0#1); 10#L93-1true assume !(0 != main_~p4~0#1); 16#L98-1true assume !(0 != main_~p5~0#1); 7#L103-1true assume !(0 != main_~p6~0#1); 14#L108-1true assume !(0 != main_~p7~0#1); 17#L113-1true [2022-12-13 20:28:40,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:28:40,015 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-12-13 20:28:40,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:28:40,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973678653] [2022-12-13 20:28:40,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:28:40,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:28:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:28:40,081 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:28:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:28:40,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:28:40,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:28:40,102 INFO L85 PathProgramCache]: Analyzing trace with hash -2067454588, now seen corresponding path program 1 times [2022-12-13 20:28:40,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:28:40,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284984594] [2022-12-13 20:28:40,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:28:40,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:28:40,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:28:40,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:28:40,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:28:40,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284984594] [2022-12-13 20:28:40,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284984594] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:28:40,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:28:40,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:28:40,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789234592] [2022-12-13 20:28:40,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:28:40,200 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 20:28:40,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:28:40,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:28:40,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:28:40,230 INFO L87 Difference]: Start difference. First operand has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 29 states have internal predecessors, (53), 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 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:28:40,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:28:40,256 INFO L93 Difference]: Finished difference Result 57 states and 94 transitions. [2022-12-13 20:28:40,257 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 94 transitions. [2022-12-13 20:28:40,259 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2022-12-13 20:28:40,262 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 47 states and 73 transitions. [2022-12-13 20:28:40,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2022-12-13 20:28:40,263 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2022-12-13 20:28:40,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 73 transitions. [2022-12-13 20:28:40,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:28:40,264 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 73 transitions. [2022-12-13 20:28:40,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 73 transitions. [2022-12-13 20:28:40,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-12-13 20:28:40,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.553191489361702) internal successors, (73), 46 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:28:40,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 73 transitions. [2022-12-13 20:28:40,287 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 73 transitions. [2022-12-13 20:28:40,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:28:40,291 INFO L428 stractBuchiCegarLoop]: Abstraction has 47 states and 73 transitions. [2022-12-13 20:28:40,291 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-12-13 20:28:40,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 73 transitions. [2022-12-13 20:28:40,293 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2022-12-13 20:28:40,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 20:28:40,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 20:28:40,293 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 20:28:40,293 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:28:40,294 INFO L748 eck$LassoCheckResult]: Stem: 121#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 100#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_~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_~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;havoc main_~cond~0#1; 101#L113-1 [2022-12-13 20:28:40,294 INFO L750 eck$LassoCheckResult]: Loop: 101#L113-1 assume !false;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 116#L34 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; 120#L53 assume !(0 != main_~p1~0#1); 123#L53-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 142#L57-1 assume !(0 != main_~p3~0#1); 141#L61-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 140#L65-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 139#L69-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 138#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 137#L77-1 assume !(0 != main_~p1~0#1); 136#L83-1 assume !(0 != main_~p2~0#1); 134#L88-1 assume !(0 != main_~p3~0#1); 132#L93-1 assume !(0 != main_~p4~0#1); 129#L98-1 assume !(0 != main_~p5~0#1); 104#L103-1 assume !(0 != main_~p6~0#1); 106#L108-1 assume !(0 != main_~p7~0#1); 101#L113-1 [2022-12-13 20:28:40,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:28:40,295 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-12-13 20:28:40,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:28:40,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092150544] [2022-12-13 20:28:40,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:28:40,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:28:40,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:28:40,302 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:28:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:28:40,308 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:28:40,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:28:40,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1216395458, now seen corresponding path program 1 times [2022-12-13 20:28:40,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:28:40,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762416] [2022-12-13 20:28:40,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:28:40,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:28:40,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:28:40,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:28:40,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:28:40,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762416] [2022-12-13 20:28:40,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762416] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:28:40,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:28:40,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:28:40,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147801128] [2022-12-13 20:28:40,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:28:40,349 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 20:28:40,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:28:40,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:28:40,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:28:40,350 INFO L87 Difference]: Start difference. First operand 47 states and 73 transitions. cyclomatic complexity: 28 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:28:40,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:28:40,367 INFO L93 Difference]: Finished difference Result 90 states and 138 transitions. [2022-12-13 20:28:40,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 138 transitions. [2022-12-13 20:28:40,369 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 88 [2022-12-13 20:28:40,370 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 90 states and 138 transitions. [2022-12-13 20:28:40,370 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2022-12-13 20:28:40,371 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2022-12-13 20:28:40,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 138 transitions. [2022-12-13 20:28:40,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:28:40,371 INFO L218 hiAutomatonCegarLoop]: Abstraction has 90 states and 138 transitions. [2022-12-13 20:28:40,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 138 transitions. [2022-12-13 20:28:40,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-12-13 20:28:40,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 90 states have (on average 1.5333333333333334) internal successors, (138), 89 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:28:40,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 138 transitions. [2022-12-13 20:28:40,379 INFO L240 hiAutomatonCegarLoop]: Abstraction has 90 states and 138 transitions. [2022-12-13 20:28:40,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:28:40,380 INFO L428 stractBuchiCegarLoop]: Abstraction has 90 states and 138 transitions. [2022-12-13 20:28:40,380 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-12-13 20:28:40,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 138 transitions. [2022-12-13 20:28:40,382 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 88 [2022-12-13 20:28:40,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 20:28:40,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 20:28:40,382 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 20:28:40,382 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:28:40,383 INFO L748 eck$LassoCheckResult]: Stem: 273#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 243#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_~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_~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;havoc main_~cond~0#1; 244#L113-1 [2022-12-13 20:28:40,383 INFO L750 eck$LassoCheckResult]: Loop: 244#L113-1 assume !false;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 290#L34 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; 291#L53 assume !(0 != main_~p1~0#1); 306#L53-2 assume !(0 != main_~p2~0#1); 255#L57-1 assume !(0 != main_~p3~0#1); 250#L61-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 251#L65-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 269#L69-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 270#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 298#L77-1 assume !(0 != main_~p1~0#1); 275#L83-1 assume !(0 != main_~p2~0#1); 258#L88-1 assume !(0 != main_~p3~0#1); 260#L93-1 assume !(0 != main_~p4~0#1); 261#L98-1 assume !(0 != main_~p5~0#1); 262#L103-1 assume !(0 != main_~p6~0#1); 309#L108-1 assume !(0 != main_~p7~0#1); 244#L113-1 [2022-12-13 20:28:40,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:28:40,383 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-12-13 20:28:40,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:28:40,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136443472] [2022-12-13 20:28:40,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:28:40,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:28:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:28:40,390 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:28:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:28:40,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:28:40,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:28:40,397 INFO L85 PathProgramCache]: Analyzing trace with hash 629589444, now seen corresponding path program 1 times [2022-12-13 20:28:40,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:28:40,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317129691] [2022-12-13 20:28:40,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:28:40,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:28:40,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:28:40,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:28:40,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:28:40,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317129691] [2022-12-13 20:28:40,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317129691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:28:40,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:28:40,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:28:40,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041136493] [2022-12-13 20:28:40,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:28:40,435 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 20:28:40,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:28:40,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:28:40,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:28:40,436 INFO L87 Difference]: Start difference. First operand 90 states and 138 transitions. cyclomatic complexity: 52 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:28:40,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:28:40,454 INFO L93 Difference]: Finished difference Result 174 states and 262 transitions. [2022-12-13 20:28:40,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 262 transitions. [2022-12-13 20:28:40,457 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 172 [2022-12-13 20:28:40,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 174 states and 262 transitions. [2022-12-13 20:28:40,459 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2022-12-13 20:28:40,459 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2022-12-13 20:28:40,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 262 transitions. [2022-12-13 20:28:40,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:28:40,460 INFO L218 hiAutomatonCegarLoop]: Abstraction has 174 states and 262 transitions. [2022-12-13 20:28:40,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 262 transitions. [2022-12-13 20:28:40,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2022-12-13 20:28:40,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 174 states have (on average 1.5057471264367817) internal successors, (262), 173 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:28:40,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 262 transitions. [2022-12-13 20:28:40,473 INFO L240 hiAutomatonCegarLoop]: Abstraction has 174 states and 262 transitions. [2022-12-13 20:28:40,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:28:40,474 INFO L428 stractBuchiCegarLoop]: Abstraction has 174 states and 262 transitions. [2022-12-13 20:28:40,475 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-12-13 20:28:40,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 262 transitions. [2022-12-13 20:28:40,477 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 172 [2022-12-13 20:28:40,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 20:28:40,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 20:28:40,477 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 20:28:40,478 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:28:40,478 INFO L748 eck$LassoCheckResult]: Stem: 541#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 513#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_~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_~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;havoc main_~cond~0#1; 514#L113-1 [2022-12-13 20:28:40,478 INFO L750 eck$LassoCheckResult]: Loop: 514#L113-1 assume !false;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 575#L34 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; 570#L53 assume !(0 != main_~p1~0#1); 571#L53-2 assume !(0 != main_~p2~0#1); 627#L57-1 assume !(0 != main_~p3~0#1); 624#L61-1 assume !(0 != main_~p4~0#1); 620#L65-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 615#L69-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 611#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 607#L77-1 assume !(0 != main_~p1~0#1); 606#L83-1 assume !(0 != main_~p2~0#1); 605#L88-1 assume !(0 != main_~p3~0#1); 602#L93-1 assume !(0 != main_~p4~0#1); 600#L98-1 assume !(0 != main_~p5~0#1); 599#L103-1 assume !(0 != main_~p6~0#1); 597#L108-1 assume !(0 != main_~p7~0#1); 514#L113-1 [2022-12-13 20:28:40,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:28:40,479 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-12-13 20:28:40,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:28:40,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471900305] [2022-12-13 20:28:40,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:28:40,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:28:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:28:40,485 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:28:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:28:40,491 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:28:40,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:28:40,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1330654022, now seen corresponding path program 1 times [2022-12-13 20:28:40,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:28:40,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764126355] [2022-12-13 20:28:40,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:28:40,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:28:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:28:40,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:28:40,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:28:40,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764126355] [2022-12-13 20:28:40,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764126355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:28:40,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:28:40,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:28:40,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495266887] [2022-12-13 20:28:40,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:28:40,523 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 20:28:40,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:28:40,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:28:40,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:28:40,524 INFO L87 Difference]: Start difference. First operand 174 states and 262 transitions. cyclomatic complexity: 96 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:28:40,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:28:40,541 INFO L93 Difference]: Finished difference Result 338 states and 498 transitions. [2022-12-13 20:28:40,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 338 states and 498 transitions. [2022-12-13 20:28:40,545 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 336 [2022-12-13 20:28:40,548 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 338 states to 338 states and 498 transitions. [2022-12-13 20:28:40,548 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 338 [2022-12-13 20:28:40,549 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 338 [2022-12-13 20:28:40,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 338 states and 498 transitions. [2022-12-13 20:28:40,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:28:40,551 INFO L218 hiAutomatonCegarLoop]: Abstraction has 338 states and 498 transitions. [2022-12-13 20:28:40,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states and 498 transitions. [2022-12-13 20:28:40,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2022-12-13 20:28:40,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 338 states have (on average 1.4733727810650887) internal successors, (498), 337 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:28:40,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 498 transitions. [2022-12-13 20:28:40,568 INFO L240 hiAutomatonCegarLoop]: Abstraction has 338 states and 498 transitions. [2022-12-13 20:28:40,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:28:40,569 INFO L428 stractBuchiCegarLoop]: Abstraction has 338 states and 498 transitions. [2022-12-13 20:28:40,570 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-12-13 20:28:40,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 338 states and 498 transitions. [2022-12-13 20:28:40,572 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 336 [2022-12-13 20:28:40,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 20:28:40,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 20:28:40,572 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 20:28:40,573 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:28:40,573 INFO L748 eck$LassoCheckResult]: Stem: 1055#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 1031#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_~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_~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;havoc main_~cond~0#1; 1032#L113-1 [2022-12-13 20:28:40,573 INFO L750 eck$LassoCheckResult]: Loop: 1032#L113-1 assume !false;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 1077#L34 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; 1078#L53 assume !(0 != main_~p1~0#1); 1131#L53-2 assume !(0 != main_~p2~0#1); 1128#L57-1 assume !(0 != main_~p3~0#1); 1125#L61-1 assume !(0 != main_~p4~0#1); 1123#L65-1 assume !(0 != main_~p5~0#1); 1121#L69-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1118#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1114#L77-1 assume !(0 != main_~p1~0#1); 1110#L83-1 assume !(0 != main_~p2~0#1); 1108#L88-1 assume !(0 != main_~p3~0#1); 1104#L93-1 assume !(0 != main_~p4~0#1); 1101#L98-1 assume !(0 != main_~p5~0#1); 1102#L103-1 assume !(0 != main_~p6~0#1); 1097#L108-1 assume !(0 != main_~p7~0#1); 1032#L113-1 [2022-12-13 20:28:40,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:28:40,573 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-12-13 20:28:40,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:28:40,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526262325] [2022-12-13 20:28:40,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:28:40,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:28:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:28:40,578 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:28:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:28:40,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:28:40,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:28:40,584 INFO L85 PathProgramCache]: Analyzing trace with hash 937627012, now seen corresponding path program 1 times [2022-12-13 20:28:40,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:28:40,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264486853] [2022-12-13 20:28:40,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:28:40,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:28:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:28:40,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:28:40,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:28:40,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264486853] [2022-12-13 20:28:40,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264486853] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:28:40,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:28:40,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:28:40,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999085275] [2022-12-13 20:28:40,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:28:40,611 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 20:28:40,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:28:40,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:28:40,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:28:40,612 INFO L87 Difference]: Start difference. First operand 338 states and 498 transitions. cyclomatic complexity: 176 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:28:40,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:28:40,625 INFO L93 Difference]: Finished difference Result 658 states and 946 transitions. [2022-12-13 20:28:40,625 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 658 states and 946 transitions. [2022-12-13 20:28:40,630 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 656 [2022-12-13 20:28:40,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 658 states to 658 states and 946 transitions. [2022-12-13 20:28:40,633 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 658 [2022-12-13 20:28:40,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 658 [2022-12-13 20:28:40,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 658 states and 946 transitions. [2022-12-13 20:28:40,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:28:40,636 INFO L218 hiAutomatonCegarLoop]: Abstraction has 658 states and 946 transitions. [2022-12-13 20:28:40,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states and 946 transitions. [2022-12-13 20:28:40,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2022-12-13 20:28:40,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 658 states have (on average 1.4376899696048633) internal successors, (946), 657 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:28:40,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 946 transitions. [2022-12-13 20:28:40,654 INFO L240 hiAutomatonCegarLoop]: Abstraction has 658 states and 946 transitions. [2022-12-13 20:28:40,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:28:40,655 INFO L428 stractBuchiCegarLoop]: Abstraction has 658 states and 946 transitions. [2022-12-13 20:28:40,655 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-12-13 20:28:40,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 658 states and 946 transitions. [2022-12-13 20:28:40,659 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 656 [2022-12-13 20:28:40,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 20:28:40,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 20:28:40,659 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 20:28:40,659 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:28:40,660 INFO L748 eck$LassoCheckResult]: Stem: 2063#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 2033#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_~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_~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;havoc main_~cond~0#1; 2034#L113-1 [2022-12-13 20:28:40,660 INFO L750 eck$LassoCheckResult]: Loop: 2034#L113-1 assume !false;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 2214#L34 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; 2194#L53 assume !(0 != main_~p1~0#1); 2188#L53-2 assume !(0 != main_~p2~0#1); 2184#L57-1 assume !(0 != main_~p3~0#1); 2185#L61-1 assume !(0 != main_~p4~0#1); 2388#L65-1 assume !(0 != main_~p5~0#1); 2361#L69-1 assume !(0 != main_~p6~0#1); 2362#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2360#L77-1 assume !(0 != main_~p1~0#1); 2357#L83-1 assume !(0 != main_~p2~0#1); 2355#L88-1 assume !(0 != main_~p3~0#1); 2351#L93-1 assume !(0 != main_~p4~0#1); 2348#L98-1 assume !(0 != main_~p5~0#1); 2334#L103-1 assume !(0 != main_~p6~0#1); 2335#L108-1 assume !(0 != main_~p7~0#1); 2034#L113-1 [2022-12-13 20:28:40,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:28:40,660 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-12-13 20:28:40,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:28:40,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222103128] [2022-12-13 20:28:40,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:28:40,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:28:40,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:28:40,666 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:28:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:28:40,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:28:40,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:28:40,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1617685382, now seen corresponding path program 1 times [2022-12-13 20:28:40,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:28:40,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361979255] [2022-12-13 20:28:40,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:28:40,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:28:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:28:40,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:28:40,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:28:40,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361979255] [2022-12-13 20:28:40,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361979255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:28:40,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:28:40,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:28:40,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527393190] [2022-12-13 20:28:40,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:28:40,693 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 20:28:40,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:28:40,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:28:40,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:28:40,694 INFO L87 Difference]: Start difference. First operand 658 states and 946 transitions. cyclomatic complexity: 320 Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:28:40,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:28:40,716 INFO L93 Difference]: Finished difference Result 1282 states and 1794 transitions. [2022-12-13 20:28:40,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1282 states and 1794 transitions. [2022-12-13 20:28:40,726 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1280 [2022-12-13 20:28:40,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1282 states to 1282 states and 1794 transitions. [2022-12-13 20:28:40,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1282 [2022-12-13 20:28:40,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1282 [2022-12-13 20:28:40,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1282 states and 1794 transitions. [2022-12-13 20:28:40,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:28:40,742 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2022-12-13 20:28:40,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states and 1794 transitions. [2022-12-13 20:28:40,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1282. [2022-12-13 20:28:40,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1282 states have (on average 1.3993759750390016) internal successors, (1794), 1281 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:28:40,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1794 transitions. [2022-12-13 20:28:40,768 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2022-12-13 20:28:40,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:28:40,770 INFO L428 stractBuchiCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2022-12-13 20:28:40,770 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-12-13 20:28:40,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1282 states and 1794 transitions. [2022-12-13 20:28:40,776 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1280 [2022-12-13 20:28:40,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 20:28:40,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 20:28:40,776 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 20:28:40,776 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:28:40,776 INFO L748 eck$LassoCheckResult]: Stem: 4011#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 3979#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_~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_~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;havoc main_~cond~0#1; 3980#L113-1 [2022-12-13 20:28:40,776 INFO L750 eck$LassoCheckResult]: Loop: 3980#L113-1 assume !false;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 4223#L34 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; 4217#L53 assume !(0 != main_~p1~0#1); 4211#L53-2 assume !(0 != main_~p2~0#1); 4205#L57-1 assume !(0 != main_~p3~0#1); 4200#L61-1 assume !(0 != main_~p4~0#1); 4201#L65-1 assume !(0 != main_~p5~0#1); 4254#L69-1 assume !(0 != main_~p6~0#1); 4251#L73-1 assume !(0 != main_~p7~0#1); 4248#L77-1 assume !(0 != main_~p1~0#1); 4234#L83-1 assume !(0 != main_~p2~0#1); 4233#L88-1 assume !(0 != main_~p3~0#1); 4230#L93-1 assume !(0 != main_~p4~0#1); 4231#L98-1 assume !(0 != main_~p5~0#1); 4228#L103-1 assume !(0 != main_~p6~0#1); 4226#L108-1 assume !(0 != main_~p7~0#1); 3980#L113-1 [2022-12-13 20:28:40,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:28:40,777 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2022-12-13 20:28:40,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:28:40,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408941901] [2022-12-13 20:28:40,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:28:40,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:28:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:28:40,780 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:28:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:28:40,783 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:28:40,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:28:40,783 INFO L85 PathProgramCache]: Analyzing trace with hash 808338756, now seen corresponding path program 1 times [2022-12-13 20:28:40,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:28:40,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450094547] [2022-12-13 20:28:40,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:28:40,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:28:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:28:40,787 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:28:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:28:40,791 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:28:40,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:28:40,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1317176582, now seen corresponding path program 1 times [2022-12-13 20:28:40,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:28:40,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670462028] [2022-12-13 20:28:40,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:28:40,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:28:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:28:40,796 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:28:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:28:40,800 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:28:41,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:28:41,004 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:28:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:28:41,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.12 08:28:41 BoogieIcfgContainer [2022-12-13 20:28:41,028 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-12-13 20:28:41,028 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 20:28:41,028 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 20:28:41,029 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 20:28:41,029 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:28:39" (3/4) ... [2022-12-13 20:28:41,031 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-12-13 20:28:41,056 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd0b267c-5eb2-469d-ae56-84eb0c143765/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 20:28:41,056 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 20:28:41,057 INFO L158 Benchmark]: Toolchain (without parser) took 1566.13ms. Allocated memory was 115.3MB in the beginning and 151.0MB in the end (delta: 35.7MB). Free memory was 86.4MB in the beginning and 76.9MB in the end (delta: 9.5MB). Peak memory consumption was 44.9MB. Max. memory is 16.1GB. [2022-12-13 20:28:41,057 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 115.3MB. Free memory is still 92.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 20:28:41,057 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.87ms. Allocated memory is still 115.3MB. Free memory was 86.1MB in the beginning and 75.8MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 20:28:41,058 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.09ms. Allocated memory is still 115.3MB. Free memory was 75.8MB in the beginning and 74.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 20:28:41,058 INFO L158 Benchmark]: Boogie Preprocessor took 15.28ms. Allocated memory is still 115.3MB. Free memory was 74.2MB in the beginning and 73.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 20:28:41,058 INFO L158 Benchmark]: RCFGBuilder took 222.02ms. Allocated memory is still 115.3MB. Free memory was 72.8MB in the beginning and 61.8MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 20:28:41,059 INFO L158 Benchmark]: BuchiAutomizer took 1088.65ms. Allocated memory was 115.3MB in the beginning and 151.0MB in the end (delta: 35.7MB). Free memory was 61.8MB in the beginning and 79.0MB in the end (delta: -17.2MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2022-12-13 20:28:41,059 INFO L158 Benchmark]: Witness Printer took 28.05ms. Allocated memory is still 151.0MB. Free memory was 79.0MB in the beginning and 76.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 20:28:41,061 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.15ms. Allocated memory is still 115.3MB. Free memory is still 92.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.87ms. Allocated memory is still 115.3MB. Free memory was 86.1MB in the beginning and 75.8MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.09ms. Allocated memory is still 115.3MB. Free memory was 75.8MB in the beginning and 74.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.28ms. Allocated memory is still 115.3MB. Free memory was 74.2MB in the beginning and 73.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 222.02ms. Allocated memory is still 115.3MB. Free memory was 72.8MB in the beginning and 61.8MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 1088.65ms. Allocated memory was 115.3MB in the beginning and 151.0MB in the end (delta: 35.7MB). Free memory was 61.8MB in the beginning and 79.0MB in the end (delta: -17.2MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. * Witness Printer took 28.05ms. Allocated memory is still 151.0MB. Free memory was 79.0MB in the beginning and 76.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (6 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.6 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 1282 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.0s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 0.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 179 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 179 mSDsluCounter, 558 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 208 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30 IncrementalHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 350 mSDtfsCounter, 30 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI6 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: 32]: 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; [L30] int cond; Loop: [L32] COND TRUE 1 [L33] cond = __VERIFIER_nondet_int() [L34] COND FALSE !(cond == 0) [L37] lk1 = 0 [L39] lk2 = 0 [L41] lk3 = 0 [L43] lk4 = 0 [L45] lk5 = 0 [L47] lk6 = 0 [L49] lk7 = 0 [L53] COND FALSE !(p1 != 0) [L57] COND FALSE !(p2 != 0) [L61] COND FALSE !(p3 != 0) [L65] COND FALSE !(p4 != 0) [L69] COND FALSE !(p5 != 0) [L73] COND FALSE !(p6 != 0) [L77] COND FALSE !(p7 != 0) [L83] COND FALSE !(p1 != 0) [L88] COND FALSE !(p2 != 0) [L93] COND FALSE !(p3 != 0) [L98] COND FALSE !(p4 != 0) [L103] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L113] COND FALSE !(p7 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 32]: 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; [L30] int cond; Loop: [L32] COND TRUE 1 [L33] cond = __VERIFIER_nondet_int() [L34] COND FALSE !(cond == 0) [L37] lk1 = 0 [L39] lk2 = 0 [L41] lk3 = 0 [L43] lk4 = 0 [L45] lk5 = 0 [L47] lk6 = 0 [L49] lk7 = 0 [L53] COND FALSE !(p1 != 0) [L57] COND FALSE !(p2 != 0) [L61] COND FALSE !(p3 != 0) [L65] COND FALSE !(p4 != 0) [L69] COND FALSE !(p5 != 0) [L73] COND FALSE !(p6 != 0) [L77] COND FALSE !(p7 != 0) [L83] COND FALSE !(p1 != 0) [L88] COND FALSE !(p2 != 0) [L93] COND FALSE !(p3 != 0) [L98] COND FALSE !(p4 != 0) [L103] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L113] COND FALSE !(p7 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-12-13 20:28:41,082 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd0b267c-5eb2-469d-ae56-84eb0c143765/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)