./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_3+newton_3_8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 527bcce2 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_28fc2e9c-2e8e-4ead-8906-a7598e2d92d4/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28fc2e9c-2e8e-4ead-8906-a7598e2d92d4/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28fc2e9c-2e8e-4ead-8906-a7598e2d92d4/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28fc2e9c-2e8e-4ead-8906-a7598e2d92d4/bin/uautomizer-verify-bycVGegfSx/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_3+newton_3_8.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28fc2e9c-2e8e-4ead-8906-a7598e2d92d4/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28fc2e9c-2e8e-4ead-8906-a7598e2d92d4/bin/uautomizer-verify-bycVGegfSx --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 6398dd839d77433d1687aba555077cd298c276d20f879ef7dc3c0a3d5c207e2a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:07:10,090 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:07:10,189 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28fc2e9c-2e8e-4ead-8906-a7598e2d92d4/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-21 22:07:10,199 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:07:10,200 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:07:10,239 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:07:10,242 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:07:10,243 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:07:10,244 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-21 22:07:10,249 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-21 22:07:10,250 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 22:07:10,250 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 22:07:10,251 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:07:10,253 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:07:10,253 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:07:10,254 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:07:10,254 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 22:07:10,254 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:07:10,255 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:07:10,255 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:07:10,256 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:07:10,256 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 22:07:10,257 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 22:07:10,257 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 22:07:10,258 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:07:10,258 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 22:07:10,258 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:07:10,259 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:07:10,260 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:07:10,260 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 22:07:10,262 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 22:07:10,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:07:10,262 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:07:10,263 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 22:07:10,263 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 22:07:10,263 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:07:10,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 22:07:10,264 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 22:07:10,264 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 22:07:10,264 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 22:07:10,264 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 22:07:10,265 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 22:07:10,265 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_28fc2e9c-2e8e-4ead-8906-a7598e2d92d4/bin/uautomizer-verify-bycVGegfSx/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_28fc2e9c-2e8e-4ead-8906-a7598e2d92d4/bin/uautomizer-verify-bycVGegfSx 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 -> 6398dd839d77433d1687aba555077cd298c276d20f879ef7dc3c0a3d5c207e2a [2023-11-21 22:07:10,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:07:10,579 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:07:10,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:07:10,583 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:07:10,584 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:07:10,585 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28fc2e9c-2e8e-4ead-8906-a7598e2d92d4/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/combinations/gcd_3+newton_3_8.i [2023-11-21 22:07:13,786 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:07:14,079 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:07:14,079 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28fc2e9c-2e8e-4ead-8906-a7598e2d92d4/sv-benchmarks/c/combinations/gcd_3+newton_3_8.i [2023-11-21 22:07:14,087 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28fc2e9c-2e8e-4ead-8906-a7598e2d92d4/bin/uautomizer-verify-bycVGegfSx/data/a4c932622/7435ebd72a3f4f2dbb693721f378abf9/FLAG67747230b [2023-11-21 22:07:14,101 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28fc2e9c-2e8e-4ead-8906-a7598e2d92d4/bin/uautomizer-verify-bycVGegfSx/data/a4c932622/7435ebd72a3f4f2dbb693721f378abf9 [2023-11-21 22:07:14,104 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:07:14,105 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:07:14,107 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:07:14,107 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:07:14,113 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:07:14,114 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:07:14" (1/1) ... [2023-11-21 22:07:14,114 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78609980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:07:14, skipping insertion in model container [2023-11-21 22:07:14,115 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:07:14" (1/1) ... [2023-11-21 22:07:14,148 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:07:14,295 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_28fc2e9c-2e8e-4ead-8906-a7598e2d92d4/sv-benchmarks/c/combinations/gcd_3+newton_3_8.i[1226,1239] [2023-11-21 22:07:14,321 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_28fc2e9c-2e8e-4ead-8906-a7598e2d92d4/sv-benchmarks/c/combinations/gcd_3+newton_3_8.i[2862,2875] [2023-11-21 22:07:14,325 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:07:14,341 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:07:14,353 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_28fc2e9c-2e8e-4ead-8906-a7598e2d92d4/sv-benchmarks/c/combinations/gcd_3+newton_3_8.i[1226,1239] [2023-11-21 22:07:14,368 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_28fc2e9c-2e8e-4ead-8906-a7598e2d92d4/sv-benchmarks/c/combinations/gcd_3+newton_3_8.i[2862,2875] [2023-11-21 22:07:14,370 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:07:14,387 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:07:14,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:07:14 WrapperNode [2023-11-21 22:07:14,388 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:07:14,389 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:07:14,389 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:07:14,389 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:07:14,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:07:14" (1/1) ... [2023-11-21 22:07:14,406 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:07:14" (1/1) ... [2023-11-21 22:07:14,435 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 93 [2023-11-21 22:07:14,436 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:07:14,437 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:07:14,437 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:07:14,437 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:07:14,449 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:07:14" (1/1) ... [2023-11-21 22:07:14,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:07:14" (1/1) ... [2023-11-21 22:07:14,452 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:07:14" (1/1) ... [2023-11-21 22:07:14,473 INFO L187 HeapSplitter]: Split 10 memory accesses to 2 slices as follows [2, 8] [2023-11-21 22:07:14,473 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:07:14" (1/1) ... [2023-11-21 22:07:14,473 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:07:14" (1/1) ... [2023-11-21 22:07:14,480 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:07:14" (1/1) ... [2023-11-21 22:07:14,483 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:07:14" (1/1) ... [2023-11-21 22:07:14,485 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:07:14" (1/1) ... [2023-11-21 22:07:14,486 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:07:14" (1/1) ... [2023-11-21 22:07:14,489 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:07:14,490 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:07:14,490 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:07:14,490 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:07:14,491 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:07:14" (1/1) ... [2023-11-21 22:07:14,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:07:14,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28fc2e9c-2e8e-4ead-8906-a7598e2d92d4/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:07:14,533 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28fc2e9c-2e8e-4ead-8906-a7598e2d92d4/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 22:07:14,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28fc2e9c-2e8e-4ead-8906-a7598e2d92d4/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 22:07:14,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:07:14,572 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2023-11-21 22:07:14,572 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2023-11-21 22:07:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-11-21 22:07:14,573 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-11-21 22:07:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-21 22:07:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-21 22:07:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:07:14,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:07:14,640 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:07:14,642 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:07:14,847 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:07:14,934 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:07:14,934 INFO L308 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-21 22:07:14,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:07:14 BoogieIcfgContainer [2023-11-21 22:07:14,936 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:07:14,939 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 22:07:14,939 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 22:07:14,942 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 22:07:14,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:07:14" (1/3) ... [2023-11-21 22:07:14,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f176a3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:07:14, skipping insertion in model container [2023-11-21 22:07:14,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:07:14" (2/3) ... [2023-11-21 22:07:14,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f176a3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:07:14, skipping insertion in model container [2023-11-21 22:07:14,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:07:14" (3/3) ... [2023-11-21 22:07:14,945 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_3_8.i [2023-11-21 22:07:14,965 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 22:07:14,966 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-21 22:07:15,008 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 22:07:15,015 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;@2603fa5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:07:15,015 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-21 22:07:15,019 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 17 states have (on average 1.411764705882353) internal successors, (24), 19 states have internal predecessors, (24), 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-21 22:07:15,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-21 22:07:15,025 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:07:15,026 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-21 22:07:15,026 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:07:15,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:07:15,031 INFO L85 PathProgramCache]: Analyzing trace with hash -377832024, now seen corresponding path program 1 times [2023-11-21 22:07:15,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:07:15,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6320386] [2023-11-21 22:07:15,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:07:15,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:07:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:07:15,582 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-21 22:07:15,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:07:15,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6320386] [2023-11-21 22:07:15,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6320386] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:07:15,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:07:15,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:07:15,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15899642] [2023-11-21 22:07:15,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:07:15,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:07:15,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:07:15,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:07:15,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:07:15,637 INFO L87 Difference]: Start difference. First operand has 28 states, 17 states have (on average 1.411764705882353) internal successors, (24), 19 states have internal predecessors, (24), 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 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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-21 22:07:15,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:07:15,782 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2023-11-21 22:07:15,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:07:15,784 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 6 [2023-11-21 22:07:15,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:07:15,792 INFO L225 Difference]: With dead ends: 40 [2023-11-21 22:07:15,792 INFO L226 Difference]: Without dead ends: 24 [2023-11-21 22:07:15,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:07:15,799 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:07:15,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 83 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:07:15,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-21 22:07:15,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-21 22:07:15,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 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-21 22:07:15,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2023-11-21 22:07:15,841 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 6 [2023-11-21 22:07:15,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:07:15,841 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2023-11-21 22:07:15,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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-21 22:07:15,842 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2023-11-21 22:07:15,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-21 22:07:15,843 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:07:15,843 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:07:15,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 22:07:15,844 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:07:15,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:07:15,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1099445991, now seen corresponding path program 1 times [2023-11-21 22:07:15,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:07:15,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134180229] [2023-11-21 22:07:15,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:07:15,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:07:15,866 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-21 22:07:15,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1334443445] [2023-11-21 22:07:15,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:07:15,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:07:15,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28fc2e9c-2e8e-4ead-8906-a7598e2d92d4/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:07:15,875 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28fc2e9c-2e8e-4ead-8906-a7598e2d92d4/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:07:15,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28fc2e9c-2e8e-4ead-8906-a7598e2d92d4/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-21 22:07:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:07:15,975 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-21 22:07:15,983 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:07:18,207 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse8 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse0 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse1 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0)) (.cse6 (<= 128 .cse8)) (.cse3 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse4 (+ .cse8 (- 256))) (.cse5 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse7 (<= .cse8 127))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= |v_ULTIMATE.start_gcd_test_~b#1_22| 127) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_22| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_22|))) .cse0) (and .cse1 (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (let ((.cse2 (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_22|))) (and (not (= .cse2 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_22|)) (= (mod (+ .cse2 |v_ULTIMATE.start_gcd_test_~b#1_22|) 256) .cse3) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_22| 1) 0)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_22| 1) 0) (= (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_22|) 0))) .cse5)) .cse6) (and .cse7 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse8 |v_ULTIMATE.start_gcd_test_~b#1_22|) 256)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_22|)) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_22| 1) 0)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_22|)) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_22| 1) 0))) .cse0) (and .cse1 (or (and .cse6 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (let ((.cse9 (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_22|))) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_22| 127) (not (= .cse9 0)) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (= (mod (+ .cse9 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_22|)) 256) .cse3) (not (= |v_ULTIMATE.start_gcd_test_~b#1_22| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_22|)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_22| 127) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (= (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_22|) 0) (not (= |v_ULTIMATE.start_gcd_test_~b#1_22| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_22|))) .cse5))) (and .cse7 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse8 |v_ULTIMATE.start_gcd_test_~b#1_22|) 256)) (<= |v_ULTIMATE.start_gcd_test_~b#1_22| 127) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_22| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_22|))))))))) is different from true [2023-11-21 22:07:18,543 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse3 (<= .cse4 127)) (.cse2 (+ .cse4 (- 256))) (.cse1 (<= 128 .cse4)) (.cse0 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0)) (.cse5 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) (or (and .cse0 (or (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_22| 127) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (= (mod .cse2 |v_ULTIMATE.start_gcd_test_~b#1_22|) 0) (not (= |v_ULTIMATE.start_gcd_test_~b#1_22| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_22|)))) (and .cse3 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_22| 127) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (= (mod (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_22|) 256) 0) (not (= |v_ULTIMATE.start_gcd_test_~b#1_22| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_22|)))))) (and (or (and .cse3 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_22|)) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_22| 1) 0) (= (mod (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_22|) 256) 0)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_22| 1) 0) (= (mod .cse2 |v_ULTIMATE.start_gcd_test_~b#1_22|) 0))) .cse1)) .cse0) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) 256) 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_22| 127) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_22| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_22|))) .cse5) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) 256) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_22|)) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_22| 1) 0))) .cse5)))) is different from true [2023-11-21 22:07:18,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-21 22:07:18,668 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:07:20,216 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-21 22:07:20,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:07:20,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134180229] [2023-11-21 22:07:20,217 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-21 22:07:20,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334443445] [2023-11-21 22:07:20,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334443445] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:07:20,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-21 22:07:20,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-11-21 22:07:20,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26892730] [2023-11-21 22:07:20,219 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-21 22:07:20,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-21 22:07:20,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:07:20,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-21 22:07:20,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=42, Unknown=2, NotChecked=26, Total=90 [2023-11-21 22:07:20,222 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 10 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-21 22:07:22,630 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (< |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse0 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse1 (+ |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (or (not .cse0) (< |c_ULTIMATE.start_gcd_test_~a#1| .cse1) .cse2) (or (< |c_ULTIMATE.start_gcd_test_~b#1| .cse1) .cse2 (let ((.cse3 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|)) (.cse4 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (and (or (not (= (mod .cse3 256) 0)) (and (<= .cse4 0) (not (= .cse3 0)))) (or (not (= (mod (+ .cse3 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256) 0)) (< 0 .cse4))))) (let ((.cse12 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse5 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse6 (<= .cse1 0)) (.cse10 (<= 128 .cse12)) (.cse8 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse9 (+ .cse12 (- 256))) (.cse11 (<= .cse12 127))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= |v_ULTIMATE.start_gcd_test_~b#1_22| 127) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_22| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_22|))) .cse5) (and .cse6 (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (let ((.cse7 (mod .cse9 |v_ULTIMATE.start_gcd_test_~b#1_22|))) (and (not (= .cse7 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_22|)) (= (mod (+ .cse7 |v_ULTIMATE.start_gcd_test_~b#1_22|) 256) .cse8) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_22| 1) 0)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_22| 1) 0) (= (mod .cse9 |v_ULTIMATE.start_gcd_test_~b#1_22|) 0))) .cse0)) .cse10) (and .cse11 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse12 |v_ULTIMATE.start_gcd_test_~b#1_22|) 256)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_22|)) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_22| 1) 0)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_22|)) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_22| 1) 0))) .cse5) (and .cse6 (or (and .cse10 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (let ((.cse13 (mod .cse9 |v_ULTIMATE.start_gcd_test_~b#1_22|))) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_22| 127) (not (= .cse13 0)) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (= (mod (+ .cse13 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_22|)) 256) .cse8) (not (= |v_ULTIMATE.start_gcd_test_~b#1_22| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_22|)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_22| 127) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (= (mod .cse9 |v_ULTIMATE.start_gcd_test_~b#1_22|) 0) (not (= |v_ULTIMATE.start_gcd_test_~b#1_22| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_22|))) .cse0))) (and .cse11 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse12 |v_ULTIMATE.start_gcd_test_~b#1_22|) 256)) (<= |v_ULTIMATE.start_gcd_test_~b#1_22| 127) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_22| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_22|))))))))))) is different from true [2023-11-21 22:07:26,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:07:26,232 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2023-11-21 22:07:26,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-21 22:07:26,233 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 10 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 7 [2023-11-21 22:07:26,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:07:26,234 INFO L225 Difference]: With dead ends: 31 [2023-11-21 22:07:26,234 INFO L226 Difference]: Without dead ends: 26 [2023-11-21 22:07:26,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=30, Invalid=67, Unknown=5, NotChecked=54, Total=156 [2023-11-21 22:07:26,236 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 22:07:26,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 113 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 78 Unchecked, 0.2s Time] [2023-11-21 22:07:26,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-21 22:07:26,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-21 22:07:26,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 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-21 22:07:26,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2023-11-21 22:07:26,248 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 7 [2023-11-21 22:07:26,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:07:26,248 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2023-11-21 22:07:26,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 10 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-21 22:07:26,249 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2023-11-21 22:07:26,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-21 22:07:26,249 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:07:26,250 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2023-11-21 22:07:26,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28fc2e9c-2e8e-4ead-8906-a7598e2d92d4/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-21 22:07:26,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28fc2e9c-2e8e-4ead-8906-a7598e2d92d4/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:07:26,459 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:07:26,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:07:26,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1975388935, now seen corresponding path program 2 times [2023-11-21 22:07:26,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:07:26,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388982966] [2023-11-21 22:07:26,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:07:26,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:07:26,476 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-21 22:07:26,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [666935234] [2023-11-21 22:07:26,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 22:07:26,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:07:26,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28fc2e9c-2e8e-4ead-8906-a7598e2d92d4/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:07:26,484 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28fc2e9c-2e8e-4ead-8906-a7598e2d92d4/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:07:26,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28fc2e9c-2e8e-4ead-8906-a7598e2d92d4/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-21 22:07:26,597 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 22:07:26,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:07:26,600 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-21 22:07:26,602 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:07:47,901 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse2 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse10 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse5 (+ .cse2 (- 256))) (.cse4 (<= 128 .cse2)) (.cse3 (<= .cse2 127)) (.cse8 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse0 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0))) (or (and .cse0 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (let ((.cse1 (mod (mod .cse2 |v_ULTIMATE.start_gcd_test_~a#1_29|) 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_29|) (not (= .cse1 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_29| 127) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse1) 256) |c_ULTIMATE.start_gcd_test_~a#1|)))) .cse3) (and .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_29|) (<= |v_ULTIMATE.start_gcd_test_~a#1_29| 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| (+ (- 256) (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~a#1_29|) (mod .cse5 |v_ULTIMATE.start_gcd_test_~a#1_29|)) 256))) 256))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (let ((.cse7 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_29|))) (let ((.cse9 (mod .cse7 256))) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse9))) (and (not (= .cse6 0)) (= (mod (+ (* .cse7 255) .cse6) 256) .cse8) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_29|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_29| 1) 0) (not (= 0 .cse9))))))) .cse10) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (let ((.cse11 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_29|) 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_29|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse11) 256)) (<= |v_ULTIMATE.start_gcd_test_~a#1_29| 127) (not (= 0 .cse11))))) .cse10) (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (let ((.cse13 (mod .cse5 |v_ULTIMATE.start_gcd_test_~a#1_29|))) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_29| (+ (mod (+ |v_ULTIMATE.start_gcd_test_~a#1_29| .cse13) 256) (- 256))))) (and (= .cse8 (mod (+ .cse12 |v_ULTIMATE.start_gcd_test_~a#1_29| .cse13) 256)) (not (= .cse12 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_29|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_29| 1) 0))))) .cse4) (and .cse3 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (let ((.cse15 (mod .cse2 |v_ULTIMATE.start_gcd_test_~a#1_29|))) (let ((.cse14 (mod .cse15 256))) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse14))) (and (not (= .cse14 0)) (= .cse8 (mod (+ (* .cse15 255) .cse16) 256)) (not (= .cse16 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_29|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_29| 1) 0)))))))) .cse0)))) (let ((.cse20 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse21 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (let ((.cse39 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse67 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse66 (mod .cse67 256))) (and (= .cse66 |c_ULTIMATE.start_gcd_test_~b#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (<= 128 (mod (+ .cse67 .cse21) 256)) (<= .cse66 127)))))) (.cse28 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse65 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse64 (mod .cse65 256))) (and (= .cse64 .cse20) (<= (mod (+ .cse65 .cse21) 256) 127) (<= 128 .cse64) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|)))))) (.cse24 (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| 1) 0)) (.cse27 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse63 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse62 (mod .cse63 256))) (and (= .cse62 .cse20) (<= 128 .cse62) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (<= 128 (mod (+ .cse63 .cse21) 256))))))) (.cse47 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse46 (mod .cse21 256)) (.cse48 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~a#1|) 0))) (.cse17 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse57 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse60 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse61 (mod .cse60 256))) (and (<= (mod (+ .cse60 .cse21) 256) 127) (= .cse61 |c_ULTIMATE.start_gcd_test_~b#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (<= .cse61 127))))))) (or (and .cse17 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse19 (mod (+ .cse18 .cse21) 256))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse18) 256) 127) (<= 128 (mod .cse18 256)) (= .cse19 .cse20) (<= 128 .cse19)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse22) 256))) (and (<= (mod (+ .cse22 .cse21) 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= .cse23 127) (<= 128 (mod .cse22 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse23))))) .cse24) (and .cse24 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse25) 256))) (and (not (= .cse25 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= 128 .cse26) (= .cse26 .cse20) (<= 128 (mod (+ .cse25 .cse21) 256)) (<= (mod .cse25 256) 127)))))) (and .cse27 .cse24) (and .cse24 .cse28) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse29 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse29) 256))) (and (<= (mod (+ .cse29 .cse21) 256) 127) (not (= .cse29 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= 128 .cse30) (= .cse30 .cse20) (<= (mod .cse29 256) 127))))) .cse24) (and .cse17 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse32 (mod (+ .cse31 .cse21) 256))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse31) 256)) (<= 128 (mod .cse31 256)) (= .cse32 .cse20) (<= 128 .cse32)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse34 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse34) 256))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= .cse33 127) (<= 128 (mod .cse34 256)) (<= 128 (mod (+ .cse34 .cse21) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse33))))) .cse24) (and .cse17 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse36 (mod (+ .cse35 .cse21) 256))) (and (not (= .cse35 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse35) 256)) (= .cse36 .cse20) (<= 128 .cse36) (<= (mod .cse35 256) 127)))))) (and .cse17 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse38 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse37 (mod (+ .cse38 .cse21) 256))) (and (<= .cse37 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse38) 256) 127) (<= 128 (mod .cse38 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse37)))))) (and .cse17 .cse39) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse41 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse41) 256))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= 128 .cse40) (<= 128 (mod .cse41 256)) (= .cse40 .cse20) (<= 128 (mod (+ .cse41 .cse21) 256)))))) .cse24) (and .cse17 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse43 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse42 (mod (+ .cse43 .cse21) 256))) (and (<= .cse42 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse43) 256)) (<= 128 (mod .cse43 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse42)))))) (and .cse39 .cse24) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse44 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse45 (mod (+ .cse44 .cse21) 256))) (and (not (= .cse44 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse44) 256) 127) (= .cse45 .cse20) (<= 128 .cse45) (<= (mod .cse44 256) 127))))) .cse17) (and (<= .cse46 127) .cse47 .cse48) (and .cse17 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse50 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse49 (mod (+ .cse50 .cse21) 256))) (and (<= .cse49 127) (not (= .cse50 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse50) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse49) (<= (mod .cse50 256) 127)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse51 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse52 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse51) 256))) (and (<= (mod (+ .cse51 .cse21) 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= 128 .cse52) (<= 128 (mod .cse51 256)) (= .cse52 .cse20))))) .cse24) (and .cse24 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse53 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse54 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse53) 256))) (and (not (= .cse53 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= .cse54 127) (<= 128 (mod (+ .cse53 .cse21) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse54) (<= (mod .cse53 256) 127)))))) (and .cse17 .cse28) (and .cse24 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse55 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse56 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse55) 256))) (and (<= (mod (+ .cse55 .cse21) 256) 127) (not (= .cse55 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= .cse56 127) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse56) (<= (mod .cse55 256) 127)))))) (and .cse24 .cse57) (and .cse27 .cse17) (and .cse17 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse59 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse58 (mod (+ .cse59 .cse21) 256))) (and (<= .cse58 127) (not (= .cse59 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse59) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse58) (<= (mod .cse59 256) 127)))))) (and .cse47 (<= 128 .cse46) .cse48) (and .cse17 .cse57)))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2023-11-21 22:08:05,272 WARN L293 SmtUtils]: Spent 12.08s on a formula simplification. DAG size of input: 145 DAG size of output: 115 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-21 22:08:06,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-21 22:08:06,046 INFO L327 TraceCheckSpWp]: Computing backward predicates...