./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_2+newton_3_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_3_2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1a2810bb21e6de0cf080b546d334e2bc4a7723a0569c58531da7e4847e328a8e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:46:46,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:46:46,955 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 05:46:46,959 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:46:46,960 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:46:46,984 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:46:46,985 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:46:46,985 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:46:46,986 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:46:46,986 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:46:46,987 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:46:46,987 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:46:46,988 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:46:46,989 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:46:46,989 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:46:46,990 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:46:46,990 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:46:46,991 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:46:46,991 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:46:46,992 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:46:46,992 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:46:46,993 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:46:46,993 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:46:46,994 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:46:46,994 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:46:46,995 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:46:46,995 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:46:46,996 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:46:46,996 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:46:46,996 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:46:46,997 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:46:46,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:46:46,997 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:46:46,998 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:46:46,998 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:46:46,998 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:46:46,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:46:46,998 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:46:46,999 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:46:46,999 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:46:46,999 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:46:46,999 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:46:47,000 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/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_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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(G ! call(reach_error())) ) 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 -> 1a2810bb21e6de0cf080b546d334e2bc4a7723a0569c58531da7e4847e328a8e [2023-11-29 05:46:47,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:46:47,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:46:47,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:46:47,245 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:46:47,245 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:46:47,246 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/combinations/gcd_2+newton_3_2.i [2023-11-29 05:46:49,951 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:46:50,105 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:46:50,106 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/sv-benchmarks/c/combinations/gcd_2+newton_3_2.i [2023-11-29 05:46:50,113 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/data/dc0c42b19/acc194266b89415b84374b2a2490a20e/FLAGf501b77fa [2023-11-29 05:46:50,125 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/data/dc0c42b19/acc194266b89415b84374b2a2490a20e [2023-11-29 05:46:50,127 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:46:50,128 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:46:50,129 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:46:50,129 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:46:50,140 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:46:50,140 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:46:50" (1/1) ... [2023-11-29 05:46:50,141 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50be20ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:50, skipping insertion in model container [2023-11-29 05:46:50,142 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:46:50" (1/1) ... [2023-11-29 05:46:50,165 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:46:50,317 WARN L240 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_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/sv-benchmarks/c/combinations/gcd_2+newton_3_2.i[1226,1239] [2023-11-29 05:46:50,343 WARN L240 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_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/sv-benchmarks/c/combinations/gcd_2+newton_3_2.i[2862,2875] [2023-11-29 05:46:50,344 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:46:50,357 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:46:50,371 WARN L240 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_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/sv-benchmarks/c/combinations/gcd_2+newton_3_2.i[1226,1239] [2023-11-29 05:46:50,382 WARN L240 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_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/sv-benchmarks/c/combinations/gcd_2+newton_3_2.i[2862,2875] [2023-11-29 05:46:50,384 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:46:50,399 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:46:50,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:50 WrapperNode [2023-11-29 05:46:50,400 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:46:50,401 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:46:50,401 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:46:50,401 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:46:50,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:50" (1/1) ... [2023-11-29 05:46:50,418 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:50" (1/1) ... [2023-11-29 05:46:50,441 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 93 [2023-11-29 05:46:50,442 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:46:50,442 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:46:50,443 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:46:50,443 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:46:50,454 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:50" (1/1) ... [2023-11-29 05:46:50,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:50" (1/1) ... [2023-11-29 05:46:50,456 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:50" (1/1) ... [2023-11-29 05:46:50,467 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2023-11-29 05:46:50,467 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:50" (1/1) ... [2023-11-29 05:46:50,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:50" (1/1) ... [2023-11-29 05:46:50,473 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:50" (1/1) ... [2023-11-29 05:46:50,477 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:50" (1/1) ... [2023-11-29 05:46:50,478 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:50" (1/1) ... [2023-11-29 05:46:50,479 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:50" (1/1) ... [2023-11-29 05:46:50,482 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:46:50,483 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:46:50,483 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:46:50,484 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:46:50,484 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:50" (1/1) ... [2023-11-29 05:46:50,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:46:50,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:46:50,521 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:46:50,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:46:50,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:46:50,557 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2023-11-29 05:46:50,557 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2023-11-29 05:46:50,557 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-11-29 05:46:50,557 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-11-29 05:46:50,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:46:50,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 05:46:50,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:46:50,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:46:50,627 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:46:50,629 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:46:50,789 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:46:50,818 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:46:50,818 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 05:46:50,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:46:50 BoogieIcfgContainer [2023-11-29 05:46:50,819 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:46:50,822 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:46:50,822 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:46:50,825 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:46:50,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:46:50" (1/3) ... [2023-11-29 05:46:50,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@171eb472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:46:50, skipping insertion in model container [2023-11-29 05:46:50,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:50" (2/3) ... [2023-11-29 05:46:50,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@171eb472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:46:50, skipping insertion in model container [2023-11-29 05:46:50,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:46:50" (3/3) ... [2023-11-29 05:46:50,828 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_3_2.i [2023-11-29 05:46:50,847 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:46:50,847 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-29 05:46:50,892 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:46:50,897 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@17a1c846, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:46:50,898 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-29 05:46:50,901 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 22 states have (on average 1.5) internal successors, (33), 24 states have internal predecessors, (33), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:46:50,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 05:46:50,908 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:50,909 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:46:50,909 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:46:50,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:50,914 INFO L85 PathProgramCache]: Analyzing trace with hash 210916014, now seen corresponding path program 1 times [2023-11-29 05:46:50,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:50,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759206246] [2023-11-29 05:46:50,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:50,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:51,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:51,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:51,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:51,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759206246] [2023-11-29 05:46:51,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759206246] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:51,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:51,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:46:51,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980362775] [2023-11-29 05:46:51,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:51,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:46:51,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:51,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:46:51,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:46:51,210 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.5) internal successors, (33), 24 states have internal predecessors, (33), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) [2023-11-29 05:46:51,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:51,305 INFO L93 Difference]: Finished difference Result 67 states and 92 transitions. [2023-11-29 05:46:51,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:46:51,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) Word has length 9 [2023-11-29 05:46:51,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:51,314 INFO L225 Difference]: With dead ends: 67 [2023-11-29 05:46:51,314 INFO L226 Difference]: Without dead ends: 30 [2023-11-29 05:46:51,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:46:51,321 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 7 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:51,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 81 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:46:51,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-29 05:46:51,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2023-11-29 05:46:51,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:46:51,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2023-11-29 05:46:51,357 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 9 [2023-11-29 05:46:51,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:51,358 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2023-11-29 05:46:51,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) [2023-11-29 05:46:51,358 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2023-11-29 05:46:51,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 05:46:51,360 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:51,360 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:46:51,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:46:51,360 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:46:51,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:51,361 INFO L85 PathProgramCache]: Analyzing trace with hash 268174316, now seen corresponding path program 1 times [2023-11-29 05:46:51,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:51,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4326677] [2023-11-29 05:46:51,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:51,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:51,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:51,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:51,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4326677] [2023-11-29 05:46:51,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4326677] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:51,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:51,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:46:51,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645831925] [2023-11-29 05:46:51,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:51,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:46:51,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:51,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:46:51,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:46:51,439 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) [2023-11-29 05:46:51,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:51,475 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2023-11-29 05:46:51,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:46:51,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) Word has length 9 [2023-11-29 05:46:51,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:51,477 INFO L225 Difference]: With dead ends: 34 [2023-11-29 05:46:51,477 INFO L226 Difference]: Without dead ends: 29 [2023-11-29 05:46:51,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:46:51,479 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:51,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 73 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:46:51,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-29 05:46:51,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-11-29 05:46:51,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:46:51,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-11-29 05:46:51,486 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 9 [2023-11-29 05:46:51,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:51,487 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-11-29 05:46:51,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) [2023-11-29 05:46:51,487 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-11-29 05:46:51,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 05:46:51,488 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:51,488 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:46:51,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:46:51,488 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:46:51,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:51,489 INFO L85 PathProgramCache]: Analyzing trace with hash -291101499, now seen corresponding path program 1 times [2023-11-29 05:46:51,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:51,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440059715] [2023-11-29 05:46:51,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:51,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:51,504 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 05:46:51,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [754569307] [2023-11-29 05:46:51,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:51,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:46:51,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:46:51,508 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:46:51,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 05:46:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:51,577 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 05:46:51,581 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:46:51,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:51,645 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:46:51,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:51,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:51,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440059715] [2023-11-29 05:46:51,693 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 05:46:51,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754569307] [2023-11-29 05:46:51,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754569307] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:46:51,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:46:51,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2023-11-29 05:46:51,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454688357] [2023-11-29 05:46:51,694 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:46:51,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:46:51,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:51,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:46:51,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:46:51,696 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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) [2023-11-29 05:46:51,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:51,757 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2023-11-29 05:46:51,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:46:51,758 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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) Word has length 10 [2023-11-29 05:46:51,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:51,758 INFO L225 Difference]: With dead ends: 35 [2023-11-29 05:46:51,759 INFO L226 Difference]: Without dead ends: 30 [2023-11-29 05:46:51,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:46:51,760 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:51,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 121 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:46:51,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-29 05:46:51,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-29 05:46:51,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:46:51,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2023-11-29 05:46:51,767 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 10 [2023-11-29 05:46:51,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:51,768 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2023-11-29 05:46:51,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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) [2023-11-29 05:46:51,768 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2023-11-29 05:46:51,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 05:46:51,769 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:51,769 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:46:51,779 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:46:51,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:46:51,970 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:46:51,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:51,970 INFO L85 PathProgramCache]: Analyzing trace with hash -448782580, now seen corresponding path program 2 times [2023-11-29 05:46:51,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:51,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912347833] [2023-11-29 05:46:51,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:51,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:51,983 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 05:46:51,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1338392949] [2023-11-29 05:46:51,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:46:51,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:46:51,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:46:51,985 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:46:51,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 05:46:52,061 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 05:46:52,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:46:52,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 05:46:52,065 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:47:15,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:15,375 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:47:56,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:47:56,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:47:56,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912347833] [2023-11-29 05:47:56,184 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 05:47:56,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338392949] [2023-11-29 05:47:56,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338392949] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:47:56,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:47:56,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-29 05:47:56,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194365205] [2023-11-29 05:47:56,185 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:47:56,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 05:47:56,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:47:56,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 05:47:56,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=138, Unknown=6, NotChecked=0, Total=182 [2023-11-29 05:47:56,186 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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) [2023-11-29 05:48:01,995 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_ULTIMATE.start_main1_~y~0#1| 1))) (and (or (let ((.cse4 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (let ((.cse71 (mod |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse72 (mod .cse4 256))) (let ((.cse57 (< .cse72 128)) (.cse2 (+ 257 |c_ULTIMATE.start_main1_~y~0#1|)) (.cse58 (< .cse71 128)) (.cse55 (< 0 .cse10)) (.cse66 (< 127 .cse72)) (.cse63 (< 127 .cse71)) (.cse56 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (not (= (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|) 0))))) (let ((.cse7 (or .cse55 .cse66 .cse63 .cse56)) (.cse8 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse70 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse69 (mod .cse70 256))) (or (< .cse69 .cse10) (< 127 (mod (+ .cse70 .cse4) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse69) (< 127 (mod (+ .cse70 |c_ULTIMATE.start_gcd_test_~b#1|) 256))))))) (.cse18 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse68 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse67 (mod .cse68 256))) (or (< .cse67 .cse10) (< (mod (+ .cse68 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod (+ .cse68 .cse4) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse67)))))) (.cse21 (or .cse55 .cse66 .cse56 .cse58)) (.cse0 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse65 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse64 (mod .cse65 256))) (or (< .cse64 .cse2) (< .cse64 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse65 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse65 .cse4) 256) 128)))))) (.cse35 (or .cse55 .cse63 .cse56 .cse57)) (.cse36 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse62 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse61 (mod .cse62 256))) (or (< .cse61 .cse10) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse61) (< 127 (mod (+ .cse62 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse62 .cse4) 256) 128)))))) (.cse26 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse60 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse59 (mod .cse60 256))) (or (< .cse59 .cse2) (< .cse59 128) (< (mod (+ .cse60 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod (+ .cse60 .cse4) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (.cse12 (or .cse55 .cse56 .cse57 .cse58)) (.cse13 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse54 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse53 (mod .cse54 256))) (or (< .cse53 .cse10) (< (mod (+ .cse54 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse53) (< (mod (+ .cse54 .cse4) 256) 128)))))) (.cse5 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse32 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse52 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse51 (mod .cse52 256))) (or (< .cse51 .cse2) (< .cse51 128) (< 127 (mod (+ .cse52 .cse4) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse52 |c_ULTIMATE.start_gcd_test_~b#1|) 256))))))) (.cse6 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse29 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse50 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse49 (mod .cse50 256))) (or (< .cse49 .cse2) (< .cse49 128) (< (mod (+ .cse50 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< (mod (+ .cse50 .cse4) 256) 128))))))) (and (or (and .cse0 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse3 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse1 (mod (+ .cse3 .cse4) 256))) (or (< .cse1 .cse2) (< (mod .cse3 256) 128) (< 127 (mod (+ .cse3 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse1 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) .cse5) (or .cse6 (and .cse7 .cse8 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse11 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse9 (mod (+ .cse11 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse9 .cse10) (< 127 (mod (+ .cse11 .cse4) 256)) (< 127 (mod .cse11 256)) (< 127 .cse9) (= .cse11 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse6 (and .cse12 .cse13 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse15 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse14 (mod (+ .cse15 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse14 128) (< .cse14 .cse2) (< 127 (mod .cse15 256)) (< (mod (+ .cse15 .cse4) 256) 128) (= .cse15 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse5 (and .cse7 .cse8 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse17 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse16 (mod (+ .cse17 .cse4) 256))) (or (< 127 .cse16) (< .cse16 .cse10) (< 127 (mod .cse17 256)) (< 127 (mod (+ .cse17 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (= .cse17 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or (and .cse18 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse19 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (mod (+ .cse19 .cse4) 256))) (or (< (mod (+ .cse19 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 .cse20) (< .cse20 .cse10) (< 127 (mod .cse19 256)) (= .cse19 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse21) .cse5) (or .cse6 (and .cse18 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse23 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse22 (mod (+ .cse23 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse22 128) (< .cse22 .cse2) (< 127 (mod (+ .cse23 .cse4) 256)) (< 127 (mod .cse23 256)) (= .cse23 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse21)) (or .cse6 (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse24 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse25 (mod (+ .cse24 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse24 256) 128) (< .cse25 128) (< .cse25 .cse2) (< 127 (mod (+ .cse24 .cse4) 256)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse26)) (or .cse5 (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse28 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse27 (mod (+ .cse28 .cse4) 256))) (or (< .cse27 .cse2) (< (mod .cse28 256) 128) (< (mod (+ .cse28 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< .cse27 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse29)) (or .cse6 (and .cse0 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse30 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse31 (mod (+ .cse30 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse30 256) 128) (< .cse31 .cse10) (< 127 .cse31) (< (mod (+ .cse30 .cse4) 256) 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse6 (and .cse32 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse33 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse34 (mod (+ .cse33 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse33 256) 128) (< .cse34 .cse10) (< 127 (mod (+ .cse33 .cse4) 256)) (< 127 .cse34) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse6 (and .cse35 .cse36 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse38 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse37 (mod (+ .cse38 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse37 .cse10) (< 127 (mod .cse38 256)) (< 127 .cse37) (< (mod (+ .cse38 .cse4) 256) 128) (= .cse38 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse5 (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse40 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse39 (mod (+ .cse40 .cse4) 256))) (or (< .cse39 .cse2) (< 127 (mod .cse40 256)) (< 127 (mod (+ .cse40 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse39 128) (= .cse40 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse35 .cse36)) (or (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse41 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse42 (mod (+ .cse41 .cse4) 256))) (or (< (mod .cse41 256) 128) (< (mod (+ .cse41 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 .cse42) (< .cse42 .cse10) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse26) .cse5) (or .cse5 (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse44 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse43 (mod (+ .cse44 .cse4) 256))) (or (< .cse43 .cse2) (< (mod (+ .cse44 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod .cse44 256)) (< .cse43 128) (= .cse44 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse12 .cse13)) (or .cse5 (and .cse32 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse45 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse46 (mod (+ .cse45 .cse4) 256))) (or (< (mod .cse45 256) 128) (< 127 .cse46) (< .cse46 .cse10) (< 127 (mod (+ .cse45 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse6 (and .cse29 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse47 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse48 (mod (+ .cse47 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse47 256) 128) (< .cse48 128) (< .cse48 .cse2) (< (mod (+ .cse47 .cse4) 256) 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (or (< |c_ULTIMATE.start_gcd_test_~a#1| .cse10) (< 126 |c_ULTIMATE.start_main1_~y~0#1|)) (let ((.cse73 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse86 (<= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_15| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse75 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse74 (mod (+ .cse75 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (<= .cse73 .cse74) (<= 128 (mod .cse75 256)) (<= 128 .cse74) (<= 128 (mod (+ .cse75 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_15| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse76 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse77 (mod (+ .cse76 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (not (= .cse76 0)) (<= (mod .cse76 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= .cse77 127) (<= (mod (+ .cse76 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127) (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse77))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse78 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse79 (mod (+ .cse78 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (not (= .cse78 0)) (<= 128 (mod (+ .cse78 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= (mod .cse78 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= .cse79 127) (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse79))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_15| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse81 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse80 (mod .cse81 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse80) (<= .cse80 127) (<= (mod (+ .cse81 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256) 127) (<= (mod (+ .cse81 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse83 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse82 (mod .cse83 256))) (and (<= 128 .cse82) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= (mod (+ .cse83 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256) 127) (<= (mod (+ .cse83 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127) (<= .cse73 .cse82))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse84 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse85 (mod .cse84 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= 128 (mod (+ .cse84 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256)) (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse85) (<= .cse85 127) (<= (mod (+ .cse84 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (and .cse86 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (v_y_7 Int) (v_z_9 Int) (v_y_9 Int)) (let ((.cse89 (* 256 v_y_9)) (.cse90 (* 255 v_z_9))) (let ((.cse87 (+ .cse89 .cse90)) (.cse88 (+ .cse89 .cse90 (* 256 v_y_7)))) (and (<= v_z_9 255) (<= 128 .cse87) (<= .cse88 |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 v_z_9) (<= .cse87 255) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_18| .cse88) 0) (<= 0 .cse88)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse92 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse91 (mod (+ .cse92 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (<= .cse73 .cse91) (<= 128 (mod .cse92 256)) (<= 128 .cse91) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= (mod (+ .cse92 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse94 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse93 (mod .cse94 256))) (and (<= 128 .cse93) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= 128 (mod (+ .cse94 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256)) (<= (mod (+ .cse94 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127) (<= .cse73 .cse93))))) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse96 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse95 (mod .cse96 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse95) (<= 128 (mod (+ .cse96 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= .cse95 127) (<= (mod (+ .cse96 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256) 127))))))) (and .cse86 (exists ((v_z_3 Int) (v_y_3 Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (v_y_1 Int)) (let ((.cse99 (* 255 v_z_3)) (.cse100 (* 256 v_y_3))) (let ((.cse97 (+ (* 256 v_y_1) .cse99 .cse100)) (.cse98 (+ .cse99 .cse100))) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_18| .cse97) 0) (<= 0 .cse98) (<= 0 .cse97) (<= .cse97 |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 v_z_3) (<= v_z_3 255) (<= .cse98 127)))))) (and (exists ((v_y_4 Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (v_y_6 Int) (v_z_6 Int)) (let ((.cse103 (* 256 v_y_6)) (.cse104 (* 255 v_z_6))) (let ((.cse102 (+ (* 256 v_y_4) .cse103 .cse104)) (.cse101 (+ .cse103 .cse104))) (and (<= .cse101 127) (<= v_z_6 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_18| .cse102) 0) (<= .cse102 |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 v_z_6) (not (= .cse102 0)) (<= 0 .cse102) (<= 0 .cse101))))) .cse86) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_15| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse106 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse105 (mod .cse106 256))) (and (<= 128 .cse105) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= 128 (mod (+ .cse106 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256)) (<= 128 (mod (+ .cse106 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= .cse73 .cse105))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse108 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse107 (mod (+ .cse108 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (<= .cse73 .cse107) (not (= .cse108 0)) (<= 128 .cse107) (<= (mod .cse108 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= (mod (+ .cse108 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse109 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse110 (mod .cse109 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= 128 (mod (+ .cse109 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256)) (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse110) (<= 128 (mod (+ .cse109 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= .cse110 127))))) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse112 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse111 (mod .cse112 256))) (and (<= 128 .cse111) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= 128 (mod (+ .cse112 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= (mod (+ .cse112 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256) 127) (<= .cse73 .cse111))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse113 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse114 (mod (+ .cse113 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (<= 128 (mod .cse113 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= .cse114 127) (<= (mod (+ .cse113 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127) (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse114))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse116 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse115 (mod (+ .cse116 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (<= .cse73 .cse115) (not (= .cse116 0)) (<= 128 .cse115) (<= 128 (mod (+ .cse116 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= (mod .cse116 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse117 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse118 (mod (+ .cse117 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (<= 128 (mod .cse117 256)) (<= 128 (mod (+ .cse117 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= .cse118 127) (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse118))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (and .cse86 (exists ((v_y_12 Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (v_z_12 Int) (v_y_11 Int)) (let ((.cse121 (* v_y_12 256)) (.cse122 (* v_z_12 255))) (let ((.cse120 (+ .cse121 .cse122 (* v_y_11 256))) (.cse119 (+ .cse121 .cse122))) (and (<= 128 .cse119) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_18| .cse120) 0) (<= v_z_12 127) (<= .cse120 |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 v_z_12) (<= 0 .cse120) (<= .cse119 255)))))))))) is different from false [2023-11-29 05:48:21,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 05:48:26,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 05:48:42,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 05:48:46,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 05:48:47,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 05:48:54,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 05:48:54,216 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 139 [2023-11-29 05:48:54,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 75.7s TimeCoverageRelationStatistics Valid=56, Invalid=177, Unknown=11, NotChecked=28, Total=272 [2023-11-29 05:48:54,218 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 27.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:48:54,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 66 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 5 Unknown, 10 Unchecked, 27.0s Time] [2023-11-29 05:48:54,223 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 05:48:54,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:48:54,420 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:665) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:269) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:284) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.releaseLock(ChainingHoareTripleChecker.java:449) at java.base/java.util.ArrayList$ArrayListSpliterator.forEachRemaining(ArrayList.java:1655) at java.base/java.util.stream.ReferencePipeline$Head.forEach(ReferencePipeline.java:658) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.releaseLock(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:365) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 36 more [2023-11-29 05:48:54,423 INFO L158 Benchmark]: Toolchain (without parser) took 124294.42ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 117.4MB in the beginning and 81.0MB in the end (delta: 36.5MB). Peak memory consumption was 103.6MB. Max. memory is 16.1GB. [2023-11-29 05:48:54,423 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 104.9MB. Free memory was 54.6MB in the beginning and 54.5MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:48:54,423 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.91ms. Allocated memory is still 155.2MB. Free memory was 117.1MB in the beginning and 105.6MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-29 05:48:54,424 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.97ms. Allocated memory is still 155.2MB. Free memory was 105.6MB in the beginning and 103.8MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:48:54,424 INFO L158 Benchmark]: Boogie Preprocessor took 39.83ms. Allocated memory is still 155.2MB. Free memory was 103.8MB in the beginning and 101.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:48:54,424 INFO L158 Benchmark]: RCFGBuilder took 335.48ms. Allocated memory is still 155.2MB. Free memory was 101.5MB in the beginning and 88.1MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 05:48:54,424 INFO L158 Benchmark]: TraceAbstraction took 123600.51ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 87.5MB in the beginning and 81.0MB in the end (delta: 6.5MB). Peak memory consumption was 74.2MB. Max. memory is 16.1GB. [2023-11-29 05:48:54,426 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 104.9MB. Free memory was 54.6MB in the beginning and 54.5MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 270.91ms. Allocated memory is still 155.2MB. Free memory was 117.1MB in the beginning and 105.6MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.97ms. Allocated memory is still 155.2MB. Free memory was 105.6MB in the beginning and 103.8MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.83ms. Allocated memory is still 155.2MB. Free memory was 103.8MB in the beginning and 101.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 335.48ms. Allocated memory is still 155.2MB. Free memory was 101.5MB in the beginning and 88.1MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 123600.51ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 87.5MB in the beginning and 81.0MB in the end (delta: 6.5MB). Peak memory consumption was 74.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_3_2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1a2810bb21e6de0cf080b546d334e2bc4a7723a0569c58531da7e4847e328a8e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:48:56,065 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:48:56,143 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 05:48:56,149 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:48:56,150 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:48:56,177 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:48:56,177 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:48:56,178 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:48:56,178 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:48:56,179 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:48:56,180 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:48:56,180 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:48:56,181 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:48:56,181 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:48:56,182 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:48:56,182 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:48:56,183 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:48:56,183 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:48:56,184 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:48:56,184 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:48:56,185 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:48:56,185 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:48:56,186 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:48:56,186 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:48:56,187 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 05:48:56,187 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 05:48:56,188 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:48:56,188 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:48:56,188 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:48:56,189 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:48:56,189 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:48:56,190 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:48:56,190 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:48:56,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:48:56,191 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:48:56,191 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:48:56,191 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:48:56,191 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 05:48:56,191 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 05:48:56,192 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:48:56,192 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:48:56,192 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:48:56,192 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:48:56,193 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:48:56,193 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 05:48:56,193 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/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_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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(G ! call(reach_error())) ) 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 -> 1a2810bb21e6de0cf080b546d334e2bc4a7723a0569c58531da7e4847e328a8e [2023-11-29 05:48:56,476 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:48:56,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:48:56,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:48:56,500 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:48:56,500 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:48:56,502 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/combinations/gcd_2+newton_3_2.i [2023-11-29 05:48:59,226 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:48:59,415 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:48:59,416 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/sv-benchmarks/c/combinations/gcd_2+newton_3_2.i [2023-11-29 05:48:59,424 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/data/f87075ef5/6257e1d006864041a56e6b689d8b08d4/FLAGfcd889be5 [2023-11-29 05:48:59,436 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/data/f87075ef5/6257e1d006864041a56e6b689d8b08d4 [2023-11-29 05:48:59,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:48:59,440 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:48:59,442 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:48:59,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:48:59,446 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:48:59,447 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:48:59" (1/1) ... [2023-11-29 05:48:59,448 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d89ce19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:48:59, skipping insertion in model container [2023-11-29 05:48:59,448 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:48:59" (1/1) ... [2023-11-29 05:48:59,469 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:48:59,594 WARN L240 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_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/sv-benchmarks/c/combinations/gcd_2+newton_3_2.i[1226,1239] [2023-11-29 05:48:59,621 WARN L240 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_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/sv-benchmarks/c/combinations/gcd_2+newton_3_2.i[2862,2875] [2023-11-29 05:48:59,623 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:48:59,638 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:48:59,651 WARN L240 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_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/sv-benchmarks/c/combinations/gcd_2+newton_3_2.i[1226,1239] [2023-11-29 05:48:59,664 WARN L240 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_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/sv-benchmarks/c/combinations/gcd_2+newton_3_2.i[2862,2875] [2023-11-29 05:48:59,665 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:48:59,683 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:48:59,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:48:59 WrapperNode [2023-11-29 05:48:59,683 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:48:59,684 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:48:59,684 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:48:59,685 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:48:59,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:48:59" (1/1) ... [2023-11-29 05:48:59,700 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:48:59" (1/1) ... [2023-11-29 05:48:59,732 INFO L138 Inliner]: procedures = 28, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 88 [2023-11-29 05:48:59,733 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:48:59,734 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:48:59,734 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:48:59,734 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:48:59,746 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:48:59" (1/1) ... [2023-11-29 05:48:59,747 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:48:59" (1/1) ... [2023-11-29 05:48:59,775 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:48:59" (1/1) ... [2023-11-29 05:48:59,789 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2023-11-29 05:48:59,790 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:48:59" (1/1) ... [2023-11-29 05:48:59,790 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:48:59" (1/1) ... [2023-11-29 05:48:59,800 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:48:59" (1/1) ... [2023-11-29 05:48:59,803 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:48:59" (1/1) ... [2023-11-29 05:48:59,806 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:48:59" (1/1) ... [2023-11-29 05:48:59,808 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:48:59" (1/1) ... [2023-11-29 05:48:59,811 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:48:59,813 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:48:59,813 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:48:59,813 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:48:59,814 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:48:59" (1/1) ... [2023-11-29 05:48:59,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:48:59,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:48:59,846 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:48:59,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:48:59,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:48:59,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 05:48:59,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 05:48:59,881 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2023-11-29 05:48:59,881 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2023-11-29 05:48:59,882 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-11-29 05:48:59,882 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-11-29 05:48:59,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:48:59,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:48:59,966 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:48:59,968 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:49:15,967 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:49:15,995 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:49:15,995 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 05:49:15,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:49:15 BoogieIcfgContainer [2023-11-29 05:49:15,996 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:49:15,999 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:49:15,999 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:49:16,002 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:49:16,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:48:59" (1/3) ... [2023-11-29 05:49:16,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c488458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:49:16, skipping insertion in model container [2023-11-29 05:49:16,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:48:59" (2/3) ... [2023-11-29 05:49:16,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c488458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:49:16, skipping insertion in model container [2023-11-29 05:49:16,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:49:15" (3/3) ... [2023-11-29 05:49:16,005 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_3_2.i [2023-11-29 05:49:16,023 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:49:16,023 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-29 05:49:16,061 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:49:16,066 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@571ad67b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:49:16,066 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-29 05:49:16,069 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 22 states have (on average 1.5) internal successors, (33), 24 states have internal predecessors, (33), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:49:16,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 05:49:16,076 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:49:16,076 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:49:16,077 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:49:16,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:49:16,082 INFO L85 PathProgramCache]: Analyzing trace with hash 210916014, now seen corresponding path program 1 times [2023-11-29 05:49:16,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:49:16,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [272076298] [2023-11-29 05:49:16,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:49:16,095 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:49:16,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:49:16,096 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:49:16,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 05:49:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:16,159 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:49:16,164 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:49:16,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:49:16,291 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:49:16,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:49:16,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [272076298] [2023-11-29 05:49:16,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [272076298] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:49:16,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:49:16,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:49:16,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434732704] [2023-11-29 05:49:16,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:49:16,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:49:16,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:49:16,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:49:16,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:49:16,329 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.5) internal successors, (33), 24 states have internal predecessors, (33), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2023-11-29 05:49:21,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:49:25,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:49:31,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.84s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:49:35,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:49:35,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:49:35,469 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2023-11-29 05:49:35,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:49:35,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Word has length 9 [2023-11-29 05:49:35,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:49:35,476 INFO L225 Difference]: With dead ends: 61 [2023-11-29 05:49:35,476 INFO L226 Difference]: Without dead ends: 29 [2023-11-29 05:49:35,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:49:35,481 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:49:35,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 4 Unknown, 0 Unchecked, 19.1s Time] [2023-11-29 05:49:35,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-29 05:49:35,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-11-29 05:49:35,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:49:35,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-11-29 05:49:35,526 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 9 [2023-11-29 05:49:35,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:49:35,526 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-11-29 05:49:35,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2023-11-29 05:49:35,527 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2023-11-29 05:49:35,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 05:49:35,529 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:49:35,529 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:49:35,532 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:49:35,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:49:35,732 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:49:35,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:49:35,733 INFO L85 PathProgramCache]: Analyzing trace with hash 268174316, now seen corresponding path program 1 times [2023-11-29 05:49:35,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:49:35,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [862718852] [2023-11-29 05:49:35,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:49:35,734 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:49:35,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:49:35,735 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:49:35,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 05:49:35,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:35,783 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:49:35,784 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:49:35,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:49:35,960 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:49:35,961 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:49:35,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [862718852] [2023-11-29 05:49:35,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [862718852] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:49:35,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:49:35,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:49:35,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268807086] [2023-11-29 05:49:35,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:49:35,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:49:35,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:49:35,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:49:35,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:49:35,963 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) [2023-11-29 05:49:41,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:49:43,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:49:48,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.79s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:49:52,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:49:56,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:49:56,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:49:56,878 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2023-11-29 05:49:57,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:49:57,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) Word has length 9 [2023-11-29 05:49:57,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:49:57,095 INFO L225 Difference]: With dead ends: 35 [2023-11-29 05:49:57,096 INFO L226 Difference]: Without dead ends: 30 [2023-11-29 05:49:57,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:49:57,097 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:49:57,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 75 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 4 Unknown, 0 Unchecked, 20.8s Time] [2023-11-29 05:49:57,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-29 05:49:57,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2023-11-29 05:49:57,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:49:57,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-11-29 05:49:57,103 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 9 [2023-11-29 05:49:57,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:49:57,103 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-11-29 05:49:57,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) [2023-11-29 05:49:57,103 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2023-11-29 05:49:57,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 05:49:57,104 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:49:57,104 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:49:57,106 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 05:49:57,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:49:57,305 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:49:57,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:49:57,305 INFO L85 PathProgramCache]: Analyzing trace with hash -2066108861, now seen corresponding path program 1 times [2023-11-29 05:49:57,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:49:57,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [159476902] [2023-11-29 05:49:57,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:49:57,306 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:49:57,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:49:57,307 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:49:57,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 05:49:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:57,366 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:49:57,367 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:49:57,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:49:57,558 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:49:57,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:49:57,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [159476902] [2023-11-29 05:49:57,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [159476902] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:49:57,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:49:57,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:49:57,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365894608] [2023-11-29 05:49:57,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:49:57,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:49:57,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:49:57,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:49:57,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:49:57,560 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) [2023-11-29 05:50:02,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:50:06,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:50:10,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:50:16,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.84s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:50:20,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:50:24,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:50:24,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:50:24,158 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2023-11-29 05:50:24,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:50:24,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Word has length 10 [2023-11-29 05:50:24,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:50:24,384 INFO L225 Difference]: With dead ends: 36 [2023-11-29 05:50:24,385 INFO L226 Difference]: Without dead ends: 29 [2023-11-29 05:50:24,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:50:24,386 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:50:24,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 75 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 6 Unknown, 0 Unchecked, 26.6s Time] [2023-11-29 05:50:24,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-29 05:50:24,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-11-29 05:50:24,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:50:24,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-11-29 05:50:24,393 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 10 [2023-11-29 05:50:24,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:50:24,394 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-11-29 05:50:24,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) [2023-11-29 05:50:24,394 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-11-29 05:50:24,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 05:50:24,394 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:50:24,394 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:50:24,397 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 05:50:24,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:50:24,595 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:50:24,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:24,596 INFO L85 PathProgramCache]: Analyzing trace with hash -291101499, now seen corresponding path program 1 times [2023-11-29 05:50:24,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:50:24,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273677260] [2023-11-29 05:50:24,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:24,597 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:50:24,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:50:24,598 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:50:24,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 05:50:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:24,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 05:50:24,659 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:50:25,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:50:25,276 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:50:26,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:50:26,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:50:26,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [273677260] [2023-11-29 05:50:26,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [273677260] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:50:26,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:50:26,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-11-29 05:50:26,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034688941] [2023-11-29 05:50:26,124 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:50:26,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 05:50:26,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:50:26,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 05:50:26,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:50:26,126 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 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) [2023-11-29 05:50:32,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:50:36,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:50:38,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:50:45,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.87s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:50:49,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:50:53,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:50:57,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:51:01,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:51:05,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:51:09,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:51:10,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:51:11,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:51:11,601 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2023-11-29 05:51:11,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:51:11,602 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 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) Word has length 10 [2023-11-29 05:51:11,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:51:11,603 INFO L225 Difference]: With dead ends: 41 [2023-11-29 05:51:11,603 INFO L226 Difference]: Without dead ends: 32 [2023-11-29 05:51:11,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2023-11-29 05:51:11,605 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 5 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.9s IncrementalHoareTripleChecker+Time [2023-11-29 05:51:11,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 234 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 9 Unknown, 0 Unchecked, 44.9s Time] [2023-11-29 05:51:11,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-29 05:51:11,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-29 05:51:11,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:51:11,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2023-11-29 05:51:11,613 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 10 [2023-11-29 05:51:11,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:51:11,613 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2023-11-29 05:51:11,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 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) [2023-11-29 05:51:11,614 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2023-11-29 05:51:11,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 05:51:11,614 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:51:11,615 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:51:11,618 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 05:51:11,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:51:11,815 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:51:11,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:51:11,816 INFO L85 PathProgramCache]: Analyzing trace with hash 2045375020, now seen corresponding path program 2 times [2023-11-29 05:51:11,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:51:11,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [837785154] [2023-11-29 05:51:11,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:51:11,816 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:51:11,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:51:11,817 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:51:11,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c41871f5-6ce4-4d58-b3f6-e4f07a4d6a03/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 05:51:18,127 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 05:51:18,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:51:18,138 WARN L260 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-29 05:51:18,139 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:51:51,428 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:51:51,428 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:54:55,919 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:54:55,920 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:54:55,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [837785154] [2023-11-29 05:54:55,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [837785154] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:54:55,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:54:55,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2023-11-29 05:54:55,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858033970] [2023-11-29 05:54:55,920 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:54:55,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-29 05:54:55,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:54:55,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-29 05:54:55,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=350, Unknown=16, NotChecked=0, Total=462 [2023-11-29 05:54:55,921 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 22 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:55:02,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 05:55:06,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:55:10,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 05:55:14,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:55:29,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:55:34,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 05:55:38,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:55:43,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:55:47,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:55:51,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 05:55:52,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:56:13,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:56:17,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:56:21,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:56:26,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:56:30,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:56:34,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:56:38,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:56:42,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:56:46,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:56:50,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:56:54,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:56:58,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:57:02,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 05:57:06,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:57:10,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:57:14,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:57:18,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:57:22,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:57:26,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:57:30,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:57:34,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:57:36,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:57:37,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:57:41,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:57:45,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 05:57:50,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:57:53,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 05:58:09,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:58:13,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 05:58:18,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:58:22,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:59:09,810 WARN L293 SmtUtils]: Spent 20.10s on a formula simplification. DAG size of input: 43 DAG size of output: 41 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 05:59:15,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]