./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/bitvector/gcd_4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/bin/uautomizer-ug76WZFUDN/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/bitvector/gcd_4.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/bin/uautomizer-ug76WZFUDN/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 679f2fe8d678884423b2dff47bf2c3c7ede0374b3a8bb68f9a9e8a332d8776ef --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 11:50:17,175 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:50:17,178 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:50:17,225 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:50:17,228 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:50:17,234 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:50:17,238 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:50:17,242 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:50:17,245 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:50:17,254 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:50:17,256 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:50:17,258 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:50:17,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:50:17,263 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:50:17,264 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:50:17,268 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:50:17,271 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:50:17,272 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:50:17,274 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:50:17,279 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:50:17,284 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:50:17,285 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:50:17,288 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:50:17,290 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:50:17,295 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:50:17,300 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:50:17,300 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:50:17,303 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:50:17,304 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:50:17,305 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:50:17,306 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:50:17,307 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:50:17,309 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:50:17,310 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:50:17,312 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:50:17,312 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:50:17,313 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:50:17,313 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:50:17,314 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:50:17,316 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:50:17,317 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:50:17,318 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/bin/uautomizer-ug76WZFUDN/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-20 11:50:17,372 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:50:17,372 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:50:17,373 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:50:17,373 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:50:17,375 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:50:17,376 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:50:17,376 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:50:17,376 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-20 11:50:17,376 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-20 11:50:17,377 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-20 11:50:17,378 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-20 11:50:17,378 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-20 11:50:17,379 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-20 11:50:17,379 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:50:17,379 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:50:17,380 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 11:50:17,380 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:50:17,380 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:50:17,380 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:50:17,381 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-20 11:50:17,381 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-20 11:50:17,381 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-20 11:50:17,382 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:50:17,382 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 11:50:17,382 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-20 11:50:17,383 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:50:17,384 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-20 11:50:17,384 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:50:17,385 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:50:17,385 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:50:17,385 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:50:17,387 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-20 11:50:17,387 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_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/bin/uautomizer-ug76WZFUDN/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 679f2fe8d678884423b2dff47bf2c3c7ede0374b3a8bb68f9a9e8a332d8776ef [2022-11-20 11:50:17,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:50:17,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:50:17,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:50:17,752 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:50:17,752 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:50:17,754 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/bitvector/gcd_4.c [2022-11-20 11:50:21,033 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:50:21,348 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:50:21,349 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/sv-benchmarks/c/bitvector/gcd_4.c [2022-11-20 11:50:21,357 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/bin/uautomizer-ug76WZFUDN/data/933a9bdce/9ce7b3a677824c5fa6884393f43f9251/FLAGbe5875b62 [2022-11-20 11:50:21,380 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/bin/uautomizer-ug76WZFUDN/data/933a9bdce/9ce7b3a677824c5fa6884393f43f9251 [2022-11-20 11:50:21,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:50:21,390 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:50:21,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:50:21,391 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:50:21,396 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:50:21,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:50:21" (1/1) ... [2022-11-20 11:50:21,398 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ec6eaf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:21, skipping insertion in model container [2022-11-20 11:50:21,399 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:50:21" (1/1) ... [2022-11-20 11:50:21,408 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:50:21,436 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:50:21,657 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_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/sv-benchmarks/c/bitvector/gcd_4.c[662,675] [2022-11-20 11:50:21,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:50:21,696 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:50:21,711 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_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/sv-benchmarks/c/bitvector/gcd_4.c[662,675] [2022-11-20 11:50:21,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:50:21,749 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:50:21,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:21 WrapperNode [2022-11-20 11:50:21,751 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:50:21,752 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:50:21,752 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:50:21,753 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:50:21,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:21" (1/1) ... [2022-11-20 11:50:21,769 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:21" (1/1) ... [2022-11-20 11:50:21,797 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 67 [2022-11-20 11:50:21,797 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:50:21,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:50:21,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:50:21,798 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:50:21,808 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:21" (1/1) ... [2022-11-20 11:50:21,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:21" (1/1) ... [2022-11-20 11:50:21,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:21" (1/1) ... [2022-11-20 11:50:21,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:21" (1/1) ... [2022-11-20 11:50:21,825 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:21" (1/1) ... [2022-11-20 11:50:21,829 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:21" (1/1) ... [2022-11-20 11:50:21,830 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:21" (1/1) ... [2022-11-20 11:50:21,831 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:21" (1/1) ... [2022-11-20 11:50:21,845 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:50:21,846 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:50:21,846 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:50:21,846 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:50:21,847 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:21" (1/1) ... [2022-11-20 11:50:21,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 11:50:21,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:50:21,889 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 11:50:21,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-20 11:50:21,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:50:21,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 11:50:21,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:50:21,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:50:22,020 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:50:22,022 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:50:22,171 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:50:22,177 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:50:22,177 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 11:50:22,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:50:22 BoogieIcfgContainer [2022-11-20 11:50:22,180 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:50:22,181 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-20 11:50:22,181 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-20 11:50:22,186 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-20 11:50:22,186 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-20 11:50:22,187 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 11:50:21" (1/3) ... [2022-11-20 11:50:22,188 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ddfb108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 11:50:22, skipping insertion in model container [2022-11-20 11:50:22,188 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-20 11:50:22,188 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:50:21" (2/3) ... [2022-11-20 11:50:22,189 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ddfb108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 11:50:22, skipping insertion in model container [2022-11-20 11:50:22,189 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-20 11:50:22,189 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:50:22" (3/3) ... [2022-11-20 11:50:22,191 INFO L332 chiAutomizerObserver]: Analyzing ICFG gcd_4.c [2022-11-20 11:50:22,274 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-20 11:50:22,274 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-20 11:50:22,275 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-20 11:50:22,275 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-20 11:50:22,275 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-20 11:50:22,275 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-20 11:50:22,275 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-20 11:50:22,276 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-20 11:50:22,299 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:22,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-20 11:50:22,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 11:50:22,335 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 11:50:22,341 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-20 11:50:22,342 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-20 11:50:22,342 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-20 11:50:22,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:22,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-20 11:50:22,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 11:50:22,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 11:50:22,346 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-20 11:50:22,346 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-20 11:50:22,375 INFO L748 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call write~init~int(103, 2, 0, 1);call write~init~int(99, 2, 1, 1);call write~init~int(100, 2, 2, 1);call write~init~int(95, 2, 3, 1);call write~init~int(52, 2, 4, 1);call write~init~int(46, 2, 5, 1);call write~init~int(99, 2, 6, 1);call write~init~int(0, 2, 7, 1);call #Ultimate.allocInit(12, 3); 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1, main_~y~0#1, main_~g~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~g~0#1;main_~x~0#1 := 63;main_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main_~x~0#1, main_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; 18#L22true assume !(gcd_test_~a#1 < 0); 12#L22-2true assume !(gcd_test_~b#1 < 0); 13#L23-1true assume !(0 == gcd_test_~a#1); 4#L30-2true [2022-11-20 11:50:22,375 INFO L750 eck$LassoCheckResult]: Loop: 4#L30-2true assume !!(0 != gcd_test_~b#1); 7#L30true assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; 4#L30-2true [2022-11-20 11:50:22,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:22,382 INFO L85 PathProgramCache]: Analyzing trace with hash 28695882, now seen corresponding path program 1 times [2022-11-20 11:50:22,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:22,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307637613] [2022-11-20 11:50:22,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:22,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:50:22,595 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:50:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:50:22,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 11:50:22,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:22,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1862, now seen corresponding path program 1 times [2022-11-20 11:50:22,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:22,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265921106] [2022-11-20 11:50:22,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:22,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:50:22,687 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:50:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:50:22,710 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 11:50:22,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:22,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1806939727, now seen corresponding path program 1 times [2022-11-20 11:50:22,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:22,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454133967] [2022-11-20 11:50:22,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:22,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:23,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:23,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:23,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454133967] [2022-11-20 11:50:23,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454133967] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:50:23,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:50:23,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:50:23,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856690443] [2022-11-20 11:50:23,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:50:23,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:23,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:50:23,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:50:23,172 INFO L87 Difference]: Start difference. First operand has 21 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 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, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:23,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:23,232 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-11-20 11:50:23,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2022-11-20 11:50:23,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-20 11:50:23,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 9 states and 10 transitions. [2022-11-20 11:50:23,249 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-11-20 11:50:23,249 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-11-20 11:50:23,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2022-11-20 11:50:23,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:50:23,251 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-11-20 11:50:23,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2022-11-20 11:50:23,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-11-20 11:50:23,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:23,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2022-11-20 11:50:23,293 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-11-20 11:50:23,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:50:23,304 INFO L428 stractBuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-11-20 11:50:23,304 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-20 11:50:23,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2022-11-20 11:50:23,307 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-20 11:50:23,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 11:50:23,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 11:50:23,308 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:50:23,308 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-20 11:50:23,309 INFO L748 eck$LassoCheckResult]: Stem: 59#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call write~init~int(103, 2, 0, 1);call write~init~int(99, 2, 1, 1);call write~init~int(100, 2, 2, 1);call write~init~int(95, 2, 3, 1);call write~init~int(52, 2, 4, 1);call write~init~int(46, 2, 5, 1);call write~init~int(99, 2, 6, 1);call write~init~int(0, 2, 7, 1);call #Ultimate.allocInit(12, 3); 60#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1, main_~y~0#1, main_~g~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~g~0#1;main_~x~0#1 := 63;main_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main_~x~0#1, main_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; 55#L22 assume !(gcd_test_~a#1 < 0); 56#L22-2 assume !(gcd_test_~b#1 < 0); 62#L23-1 assume !(0 == gcd_test_~a#1); 63#L30-2 assume !!(0 != gcd_test_~b#1); 61#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 57#L30-2 [2022-11-20 11:50:23,309 INFO L750 eck$LassoCheckResult]: Loop: 57#L30-2 assume !!(0 != gcd_test_~b#1); 58#L30 assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; 57#L30-2 [2022-11-20 11:50:23,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:23,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1806939725, now seen corresponding path program 1 times [2022-11-20 11:50:23,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:23,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170209492] [2022-11-20 11:50:23,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:23,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:50:23,335 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:50:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:50:23,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 11:50:23,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:23,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1862, now seen corresponding path program 2 times [2022-11-20 11:50:23,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:23,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618899160] [2022-11-20 11:50:23,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:23,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:50:23,377 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:50:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:50:23,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 11:50:23,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:23,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1302289042, now seen corresponding path program 1 times [2022-11-20 11:50:23,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:23,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143219169] [2022-11-20 11:50:23,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:23,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:23,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:23,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:23,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143219169] [2022-11-20 11:50:23,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143219169] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:50:23,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751581424] [2022-11-20 11:50:23,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:23,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:50:23,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:50:23,541 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:50:23,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 11:50:23,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:23,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 11:50:23,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:50:23,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:23,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:50:23,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:23,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751581424] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:50:23,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:50:23,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2022-11-20 11:50:23,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617562908] [2022-11-20 11:50:23,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:50:23,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:23,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 11:50:23,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:50:23,894 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:23,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:23,956 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-11-20 11:50:23,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2022-11-20 11:50:23,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-20 11:50:23,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2022-11-20 11:50:23,963 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-11-20 11:50:23,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-11-20 11:50:23,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2022-11-20 11:50:23,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:50:23,964 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-11-20 11:50:23,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2022-11-20 11:50:23,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-11-20 11:50:23,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:23,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-11-20 11:50:23,969 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-11-20 11:50:23,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:50:23,971 INFO L428 stractBuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-11-20 11:50:23,971 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-20 11:50:23,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2022-11-20 11:50:23,973 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-20 11:50:23,973 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 11:50:23,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 11:50:23,977 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1] [2022-11-20 11:50:23,977 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-20 11:50:23,977 INFO L748 eck$LassoCheckResult]: Stem: 143#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call write~init~int(103, 2, 0, 1);call write~init~int(99, 2, 1, 1);call write~init~int(100, 2, 2, 1);call write~init~int(95, 2, 3, 1);call write~init~int(52, 2, 4, 1);call write~init~int(46, 2, 5, 1);call write~init~int(99, 2, 6, 1);call write~init~int(0, 2, 7, 1);call #Ultimate.allocInit(12, 3); 144#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1, main_~y~0#1, main_~g~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~g~0#1;main_~x~0#1 := 63;main_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main_~x~0#1, main_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; 140#L22 assume !(gcd_test_~a#1 < 0); 141#L22-2 assume !(gcd_test_~b#1 < 0); 145#L23-1 assume !(0 == gcd_test_~a#1); 146#L30-2 assume !!(0 != gcd_test_~b#1); 142#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 138#L30-2 assume !!(0 != gcd_test_~b#1); 139#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 150#L30-2 assume !!(0 != gcd_test_~b#1); 149#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 148#L30-2 [2022-11-20 11:50:23,977 INFO L750 eck$LassoCheckResult]: Loop: 148#L30-2 assume !!(0 != gcd_test_~b#1); 147#L30 assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; 148#L30-2 [2022-11-20 11:50:23,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:23,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1664285203, now seen corresponding path program 2 times [2022-11-20 11:50:23,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:23,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939457467] [2022-11-20 11:50:23,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:23,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:50:24,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:50:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:50:24,030 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 11:50:24,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:24,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1862, now seen corresponding path program 3 times [2022-11-20 11:50:24,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:24,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506276246] [2022-11-20 11:50:24,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:24,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:50:24,036 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:50:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:50:24,040 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 11:50:24,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:24,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1650246872, now seen corresponding path program 2 times [2022-11-20 11:50:24,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:24,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251125607] [2022-11-20 11:50:24,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:24,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:50:24,055 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:50:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:50:24,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 11:50:24,688 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 11:50:24,688 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 11:50:24,689 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 11:50:24,689 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 11:50:24,689 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-20 11:50:24,689 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 11:50:24,689 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 11:50:24,689 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 11:50:24,690 INFO L133 ssoRankerPreferences]: Filename of dumped script: gcd_4.c_Iteration3_Lasso [2022-11-20 11:50:24,690 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 11:50:24,690 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 11:50:24,711 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 11:50:24,745 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 11:50:24,749 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 11:50:24,894 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 11:50:24,915 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 11:50:24,920 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 11:50:24,958 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 11:50:24,970 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 11:50:24,974 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 11:50:24,978 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 11:50:24,983 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 11:50:25,397 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 11:50:25,402 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-20 11:50:25,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 11:50:25,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:50:25,439 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 11:50:25,450 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 11:50:25,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-11-20 11:50:25,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 11:50:25,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 11:50:25,468 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-11-20 11:50:25,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 11:50:25,495 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-11-20 11:50:25,496 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-11-20 11:50:25,546 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-20 11:50:25,606 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2022-11-20 11:50:25,606 INFO L444 ModelExtractionUtils]: 22 out of 36 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-11-20 11:50:25,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 11:50:25,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:50:25,621 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 11:50:25,623 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-20 11:50:25,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-11-20 11:50:25,653 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2022-11-20 11:50:25,654 INFO L513 LassoAnalysis]: Proved termination. [2022-11-20 11:50:25,655 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_gcd_test_~b#1) = 1*ULTIMATE.start_gcd_test_~b#1 Supporting invariants [1*ULTIMATE.start_gcd_test_~a#1 - 2 >= 0] [2022-11-20 11:50:25,670 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-11-20 11:50:25,688 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2022-11-20 11:50:25,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:25,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 11:50:25,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:50:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:25,961 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 11:50:25,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:50:25,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:25,981 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 1 loop predicates [2022-11-20 11:50:25,983 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:26,094 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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) Result 14 states and 15 transitions. Complement of second has 6 states. [2022-11-20 11:50:26,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2022-11-20 11:50:26,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:26,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2022-11-20 11:50:26,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 11 letters. Loop has 2 letters. [2022-11-20 11:50:26,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 11:50:26,101 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-20 11:50:26,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:26,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 11:50:26,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:50:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:26,324 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 11:50:26,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:50:26,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:26,331 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 1 loop predicates [2022-11-20 11:50:26,332 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:26,398 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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) Result 14 states and 15 transitions. Complement of second has 6 states. [2022-11-20 11:50:26,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2022-11-20 11:50:26,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:26,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2022-11-20 11:50:26,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 11 letters. Loop has 2 letters. [2022-11-20 11:50:26,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 11:50:26,400 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-20 11:50:26,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:26,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 11:50:26,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:50:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:26,575 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 11:50:26,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:50:26,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:26,582 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 1 loop predicates [2022-11-20 11:50:26,583 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:26,751 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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) Result 21 states and 25 transitions. Complement of second has 12 states. [2022-11-20 11:50:26,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 1 non-accepting loop states 2 accepting loop states [2022-11-20 11:50:26,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:26,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2022-11-20 11:50:26,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 11 letters. Loop has 2 letters. [2022-11-20 11:50:26,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 11:50:26,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 13 letters. Loop has 2 letters. [2022-11-20 11:50:26,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 11:50:26,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 11 letters. Loop has 4 letters. [2022-11-20 11:50:26,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 11:50:26,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 25 transitions. [2022-11-20 11:50:26,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-11-20 11:50:26,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 23 transitions. [2022-11-20 11:50:26,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-11-20 11:50:26,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-11-20 11:50:26,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2022-11-20 11:50:26,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 11:50:26,771 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-11-20 11:50:26,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2022-11-20 11:50:26,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2022-11-20 11:50:26,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:26,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-11-20 11:50:26,774 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-11-20 11:50:26,774 INFO L428 stractBuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-11-20 11:50:26,774 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-20 11:50:26,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2022-11-20 11:50:26,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-20 11:50:26,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 11:50:26,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 11:50:26,778 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2022-11-20 11:50:26,778 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-20 11:50:26,778 INFO L748 eck$LassoCheckResult]: Stem: 398#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call write~init~int(103, 2, 0, 1);call write~init~int(99, 2, 1, 1);call write~init~int(100, 2, 2, 1);call write~init~int(95, 2, 3, 1);call write~init~int(52, 2, 4, 1);call write~init~int(46, 2, 5, 1);call write~init~int(99, 2, 6, 1);call write~init~int(0, 2, 7, 1);call #Ultimate.allocInit(12, 3); 399#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1, main_~y~0#1, main_~g~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~g~0#1;main_~x~0#1 := 63;main_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main_~x~0#1, main_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; 391#L22 assume !(gcd_test_~a#1 < 0); 392#L22-2 assume !(gcd_test_~b#1 < 0); 400#L23-1 assume !(0 == gcd_test_~a#1); 401#L30-2 assume !!(0 != gcd_test_~b#1); 407#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 406#L30-2 assume !!(0 != gcd_test_~b#1); 405#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 404#L30-2 assume !!(0 != gcd_test_~b#1); 403#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 402#L30-2 assume !!(0 != gcd_test_~b#1); 397#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 393#L30-2 [2022-11-20 11:50:26,778 INFO L750 eck$LassoCheckResult]: Loop: 393#L30-2 assume !!(0 != gcd_test_~b#1); 394#L30 assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; 393#L30-2 [2022-11-20 11:50:26,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:26,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1650246870, now seen corresponding path program 3 times [2022-11-20 11:50:26,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:26,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724243058] [2022-11-20 11:50:26,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:26,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:26,918 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:26,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:26,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724243058] [2022-11-20 11:50:26,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724243058] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:50:26,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:50:26,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:50:26,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591809478] [2022-11-20 11:50:26,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:50:26,920 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 11:50:26,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:26,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1862, now seen corresponding path program 4 times [2022-11-20 11:50:26,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:26,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902882383] [2022-11-20 11:50:26,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:26,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:50:26,925 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:50:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:50:26,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 11:50:26,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:26,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:50:26,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:50:26,949 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:26,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:26,983 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-11-20 11:50:26,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2022-11-20 11:50:26,984 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-20 11:50:26,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 20 transitions. [2022-11-20 11:50:26,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-11-20 11:50:26,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-11-20 11:50:26,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2022-11-20 11:50:26,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 11:50:26,986 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-11-20 11:50:26,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2022-11-20 11:50:26,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-11-20 11:50:26,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:26,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-11-20 11:50:26,988 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-11-20 11:50:26,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:50:26,989 INFO L428 stractBuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-11-20 11:50:26,989 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-20 11:50:26,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2022-11-20 11:50:26,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-20 11:50:26,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 11:50:26,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 11:50:26,991 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 1, 1, 1, 1, 1, 1] [2022-11-20 11:50:26,991 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-20 11:50:26,991 INFO L748 eck$LassoCheckResult]: Stem: 443#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call write~init~int(103, 2, 0, 1);call write~init~int(99, 2, 1, 1);call write~init~int(100, 2, 2, 1);call write~init~int(95, 2, 3, 1);call write~init~int(52, 2, 4, 1);call write~init~int(46, 2, 5, 1);call write~init~int(99, 2, 6, 1);call write~init~int(0, 2, 7, 1);call #Ultimate.allocInit(12, 3); 444#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1, main_~y~0#1, main_~g~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~g~0#1;main_~x~0#1 := 63;main_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main_~x~0#1, main_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; 436#L22 assume !(gcd_test_~a#1 < 0); 437#L22-2 assume !(gcd_test_~b#1 < 0); 445#L23-1 assume !(0 == gcd_test_~a#1); 446#L30-2 assume !!(0 != gcd_test_~b#1); 452#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 451#L30-2 assume !!(0 != gcd_test_~b#1); 450#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 449#L30-2 assume !!(0 != gcd_test_~b#1); 448#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 447#L30-2 assume !!(0 != gcd_test_~b#1); 441#L30 assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; 440#L30-2 assume !!(0 != gcd_test_~b#1); 442#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 438#L30-2 [2022-11-20 11:50:26,992 INFO L750 eck$LassoCheckResult]: Loop: 438#L30-2 assume !!(0 != gcd_test_~b#1); 439#L30 assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; 438#L30-2 [2022-11-20 11:50:26,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:26,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1044312667, now seen corresponding path program 3 times [2022-11-20 11:50:26,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:26,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579661417] [2022-11-20 11:50:27,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:27,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:27,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-11-20 11:50:27,191 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:27,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:27,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579661417] [2022-11-20 11:50:27,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579661417] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:50:27,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683485086] [2022-11-20 11:50:27,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 11:50:27,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:50:27,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:50:27,196 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:50:27,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 11:50:27,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-20 11:50:27,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:50:27,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 11:50:27,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:50:27,427 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:27,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:50:27,550 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:27,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683485086] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:50:27,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:50:27,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2022-11-20 11:50:27,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033860143] [2022-11-20 11:50:27,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:50:27,553 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 11:50:27,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:27,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1862, now seen corresponding path program 5 times [2022-11-20 11:50:27,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:27,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63701447] [2022-11-20 11:50:27,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:27,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:50:27,559 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:50:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:50:27,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 11:50:27,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:27,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-20 11:50:27,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-11-20 11:50:27,592 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:27,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:27,681 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-11-20 11:50:27,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2022-11-20 11:50:27,684 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-20 11:50:27,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 22 transitions. [2022-11-20 11:50:27,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-11-20 11:50:27,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-11-20 11:50:27,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2022-11-20 11:50:27,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 11:50:27,686 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-11-20 11:50:27,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2022-11-20 11:50:27,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-11-20 11:50:27,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:27,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-11-20 11:50:27,689 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-11-20 11:50:27,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:50:27,691 INFO L428 stractBuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-11-20 11:50:27,692 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-20 11:50:27,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2022-11-20 11:50:27,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-20 11:50:27,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 11:50:27,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 11:50:27,698 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 4, 2, 1, 1, 1, 1, 1] [2022-11-20 11:50:27,699 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-20 11:50:27,699 INFO L748 eck$LassoCheckResult]: Stem: 587#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call write~init~int(103, 2, 0, 1);call write~init~int(99, 2, 1, 1);call write~init~int(100, 2, 2, 1);call write~init~int(95, 2, 3, 1);call write~init~int(52, 2, 4, 1);call write~init~int(46, 2, 5, 1);call write~init~int(99, 2, 6, 1);call write~init~int(0, 2, 7, 1);call #Ultimate.allocInit(12, 3); 588#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1, main_~y~0#1, main_~g~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~g~0#1;main_~x~0#1 := 63;main_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main_~x~0#1, main_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; 583#L22 assume !(gcd_test_~a#1 < 0); 584#L22-2 assume !(gcd_test_~b#1 < 0); 589#L23-1 assume !(0 == gcd_test_~a#1); 590#L30-2 assume !!(0 != gcd_test_~b#1); 597#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 596#L30-2 assume !!(0 != gcd_test_~b#1); 595#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 594#L30-2 assume !!(0 != gcd_test_~b#1); 593#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 591#L30-2 assume !!(0 != gcd_test_~b#1); 592#L30 assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; 581#L30-2 assume !!(0 != gcd_test_~b#1); 582#L30 assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; 586#L30-2 assume !!(0 != gcd_test_~b#1); 585#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 579#L30-2 [2022-11-20 11:50:27,699 INFO L750 eck$LassoCheckResult]: Loop: 579#L30-2 assume !!(0 != gcd_test_~b#1); 580#L30 assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; 579#L30-2 [2022-11-20 11:50:27,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:27,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1437871456, now seen corresponding path program 4 times [2022-11-20 11:50:27,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:27,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459856272] [2022-11-20 11:50:27,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:27,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:27,922 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:27,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:27,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459856272] [2022-11-20 11:50:27,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459856272] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:50:27,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583240941] [2022-11-20 11:50:27,924 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 11:50:27,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:50:27,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:50:27,928 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:50:27,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 11:50:27,988 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 11:50:27,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:50:27,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-20 11:50:27,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:50:28,148 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:28,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:50:28,295 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:28,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583240941] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:50:28,300 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:50:28,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-11-20 11:50:28,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748215892] [2022-11-20 11:50:28,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:50:28,304 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 11:50:28,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:28,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1862, now seen corresponding path program 6 times [2022-11-20 11:50:28,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:28,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088637940] [2022-11-20 11:50:28,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:28,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:50:28,315 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:50:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:50:28,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 11:50:28,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:28,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 11:50:28,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-11-20 11:50:28,345 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. cyclomatic complexity: 4 Second operand has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:50:28,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:28,544 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2022-11-20 11:50:28,544 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 15 transitions. [2022-11-20 11:50:28,545 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-11-20 11:50:28,545 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2022-11-20 11:50:28,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-11-20 11:50:28,545 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-11-20 11:50:28,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-11-20 11:50:28,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:50:28,545 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 11:50:28,545 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 11:50:28,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 11:50:28,546 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 11:50:28,546 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-11-20 11:50:28,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-11-20 11:50:28,546 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-11-20 11:50:28,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-11-20 11:50:28,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.11 11:50:28 BoogieIcfgContainer [2022-11-20 11:50:28,556 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-11-20 11:50:28,557 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 11:50:28,557 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 11:50:28,557 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 11:50:28,558 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:50:22" (3/4) ... [2022-11-20 11:50:28,561 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 11:50:28,561 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 11:50:28,562 INFO L158 Benchmark]: Toolchain (without parser) took 7172.50ms. Allocated memory was 180.4MB in the beginning and 218.1MB in the end (delta: 37.7MB). Free memory was 152.1MB in the beginning and 184.0MB in the end (delta: -31.9MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2022-11-20 11:50:28,565 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 111.1MB. Free memory is still 66.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:50:28,571 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.24ms. Allocated memory is still 180.4MB. Free memory was 151.8MB in the beginning and 141.8MB in the end (delta: 10.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-20 11:50:28,574 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.27ms. Allocated memory is still 180.4MB. Free memory was 141.8MB in the beginning and 140.1MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 11:50:28,575 INFO L158 Benchmark]: Boogie Preprocessor took 47.06ms. Allocated memory is still 180.4MB. Free memory was 140.1MB in the beginning and 139.2MB in the end (delta: 971.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 11:50:28,575 INFO L158 Benchmark]: RCFGBuilder took 334.02ms. Allocated memory is still 180.4MB. Free memory was 138.8MB in the beginning and 128.7MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 11:50:28,576 INFO L158 Benchmark]: BuchiAutomizer took 6375.64ms. Allocated memory was 180.4MB in the beginning and 218.1MB in the end (delta: 37.7MB). Free memory was 128.7MB in the beginning and 184.0MB in the end (delta: -55.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:50:28,576 INFO L158 Benchmark]: Witness Printer took 4.41ms. Allocated memory is still 218.1MB. Free memory is still 184.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:50:28,578 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.23ms. Allocated memory is still 111.1MB. Free memory is still 66.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.24ms. Allocated memory is still 180.4MB. Free memory was 151.8MB in the beginning and 141.8MB in the end (delta: 10.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.27ms. Allocated memory is still 180.4MB. Free memory was 141.8MB in the beginning and 140.1MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.06ms. Allocated memory is still 180.4MB. Free memory was 140.1MB in the beginning and 139.2MB in the end (delta: 971.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 334.02ms. Allocated memory is still 180.4MB. Free memory was 138.8MB in the beginning and 128.7MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 6375.64ms. Allocated memory was 180.4MB in the beginning and 218.1MB in the end (delta: 37.7MB). Free memory was 128.7MB in the beginning and 184.0MB in the end (delta: -55.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.41ms. Allocated memory is still 218.1MB. Free memory is still 184.0MB. There was no memory consumed. 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 (5 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function b and consists of 7 locations. 5 modules have a trivial ranking function, the largest among these consists of 18 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.3s and 7 iterations. TraceHistogramMax:6. Analysis of lassos took 4.4s. Construction of modules took 0.2s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 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, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 68 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 68 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 280 IncrementalHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 33 mSDtfsCounter, 280 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN3 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital151 mio100 ax100 hnf100 lsp47 ukn51 mio100 lsp100 div100 bol100 ite100 ukn100 eq202 hnf90 smp100 dnf123 smp100 tf100 neg95 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 250ms VariablesStem: 6 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-11-20 11:50:28,598 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 11:50:28,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 11:50:28,997 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-20 11:50:29,198 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_752d32a7-6fe2-47e2-9bb0-2d7f3b7353ed/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE