./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_2+newton_2_5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cef43f1-bd83-4b35-924a-7b32b9e1bded/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cef43f1-bd83-4b35-924a-7b32b9e1bded/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cef43f1-bd83-4b35-924a-7b32b9e1bded/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cef43f1-bd83-4b35-924a-7b32b9e1bded/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_2_5.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cef43f1-bd83-4b35-924a-7b32b9e1bded/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cef43f1-bd83-4b35-924a-7b32b9e1bded/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 de6f52d29ab8cbb588307c65427c40feccf3bbab41549d766ad7ad11f97b3a0b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:06:13,466 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:06:13,572 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cef43f1-bd83-4b35-924a-7b32b9e1bded/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:06:13,581 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:06:13,582 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:06:13,626 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:06:13,627 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:06:13,628 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:06:13,629 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:06:13,634 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:06:13,636 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:06:13,636 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:06:13,637 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:06:13,639 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:06:13,639 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:06:13,640 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:06:13,640 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:06:13,641 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:06:13,641 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:06:13,642 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:06:13,642 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:06:13,643 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:06:13,644 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:06:13,644 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:06:13,645 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:06:13,646 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:06:13,646 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:06:13,647 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:06:13,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:06:13,648 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:06:13,649 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:06:13,650 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:06:13,650 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:06:13,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:06:13,650 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:06:13,651 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:06:13,651 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:06:13,651 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:06:13,652 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:06:13,652 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_6cef43f1-bd83-4b35-924a-7b32b9e1bded/bin/uautomizer-verify-WvqO1wxjHP/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_6cef43f1-bd83-4b35-924a-7b32b9e1bded/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(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 -> de6f52d29ab8cbb588307c65427c40feccf3bbab41549d766ad7ad11f97b3a0b [2023-11-06 22:06:13,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:06:14,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:06:14,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:06:14,030 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:06:14,031 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:06:14,032 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cef43f1-bd83-4b35-924a-7b32b9e1bded/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/combinations/gcd_2+newton_2_5.i [2023-11-06 22:06:17,199 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:06:17,422 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:06:17,423 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cef43f1-bd83-4b35-924a-7b32b9e1bded/sv-benchmarks/c/combinations/gcd_2+newton_2_5.i [2023-11-06 22:06:17,433 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cef43f1-bd83-4b35-924a-7b32b9e1bded/bin/uautomizer-verify-WvqO1wxjHP/data/5acf231c6/63475efbd09249f199c01fb15f7fe24d/FLAGec825f555 [2023-11-06 22:06:17,450 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cef43f1-bd83-4b35-924a-7b32b9e1bded/bin/uautomizer-verify-WvqO1wxjHP/data/5acf231c6/63475efbd09249f199c01fb15f7fe24d [2023-11-06 22:06:17,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:06:17,455 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:06:17,457 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:06:17,457 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:06:17,463 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:06:17,464 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:06:17" (1/1) ... [2023-11-06 22:06:17,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c98ec1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:17, skipping insertion in model container [2023-11-06 22:06:17,466 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:06:17" (1/1) ... [2023-11-06 22:06:17,499 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:06:17,710 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_6cef43f1-bd83-4b35-924a-7b32b9e1bded/sv-benchmarks/c/combinations/gcd_2+newton_2_5.i[1226,1239] [2023-11-06 22:06:17,760 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_6cef43f1-bd83-4b35-924a-7b32b9e1bded/sv-benchmarks/c/combinations/gcd_2+newton_2_5.i[2841,2854] [2023-11-06 22:06:17,765 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:06:17,778 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:06:17,798 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_6cef43f1-bd83-4b35-924a-7b32b9e1bded/sv-benchmarks/c/combinations/gcd_2+newton_2_5.i[1226,1239] [2023-11-06 22:06:17,811 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_6cef43f1-bd83-4b35-924a-7b32b9e1bded/sv-benchmarks/c/combinations/gcd_2+newton_2_5.i[2841,2854] [2023-11-06 22:06:17,812 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:06:17,849 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:06:17,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:17 WrapperNode [2023-11-06 22:06:17,849 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:06:17,851 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:06:17,851 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:06:17,851 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:06:17,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:17" (1/1) ... [2023-11-06 22:06:17,880 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:17" (1/1) ... [2023-11-06 22:06:17,919 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 88 [2023-11-06 22:06:17,920 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:06:17,920 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:06:17,921 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:06:17,921 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:06:17,931 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:17" (1/1) ... [2023-11-06 22:06:17,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:17" (1/1) ... [2023-11-06 22:06:17,933 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:17" (1/1) ... [2023-11-06 22:06:17,934 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:17" (1/1) ... [2023-11-06 22:06:17,940 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:17" (1/1) ... [2023-11-06 22:06:17,943 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:17" (1/1) ... [2023-11-06 22:06:17,945 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:17" (1/1) ... [2023-11-06 22:06:17,947 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:17" (1/1) ... [2023-11-06 22:06:17,949 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:06:17,950 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:06:17,950 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:06:17,951 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:06:17,951 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:17" (1/1) ... [2023-11-06 22:06:17,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:06:17,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cef43f1-bd83-4b35-924a-7b32b9e1bded/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:06:17,989 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cef43f1-bd83-4b35-924a-7b32b9e1bded/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:06:18,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cef43f1-bd83-4b35-924a-7b32b9e1bded/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:06:18,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:06:18,029 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2023-11-06 22:06:18,029 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2023-11-06 22:06:18,029 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-11-06 22:06:18,029 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-11-06 22:06:18,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:06:18,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:06:18,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:06:18,111 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:06:18,114 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:06:18,311 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:06:18,318 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:06:18,318 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:06:18,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:06:18 BoogieIcfgContainer [2023-11-06 22:06:18,320 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:06:18,324 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:06:18,324 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:06:18,327 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:06:18,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:06:17" (1/3) ... [2023-11-06 22:06:18,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@472608bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:06:18, skipping insertion in model container [2023-11-06 22:06:18,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:17" (2/3) ... [2023-11-06 22:06:18,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@472608bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:06:18, skipping insertion in model container [2023-11-06 22:06:18,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:06:18" (3/3) ... [2023-11-06 22:06:18,331 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_5.i [2023-11-06 22:06:18,352 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:06:18,352 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-06 22:06:18,417 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:06:18,424 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=LoopsAndPotentialCycles, 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;@5e577345, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:06:18,424 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-06 22:06:18,429 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-06 22:06:18,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-06 22:06:18,438 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:18,438 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:18,439 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:06:18,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:18,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2023-11-06 22:06:18,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:18,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70568897] [2023-11-06 22:06:18,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:18,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:18,809 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-06 22:06:18,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:18,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70568897] [2023-11-06 22:06:18,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70568897] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:18,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:18,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:06:18,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577949668] [2023-11-06 22:06:18,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:18,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:06:18,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:18,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:06:18,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:06:18,850 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-06 22:06:18,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:18,930 INFO L93 Difference]: Finished difference Result 77 states and 98 transitions. [2023-11-06 22:06:18,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:06:18,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2023-11-06 22:06:18,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:18,940 INFO L225 Difference]: With dead ends: 77 [2023-11-06 22:06:18,940 INFO L226 Difference]: Without dead ends: 32 [2023-11-06 22:06:18,944 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-06 22:06:18,948 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 10 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:18,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 105 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:06:18,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-06 22:06:18,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2023-11-06 22:06:18,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-06 22:06:18,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2023-11-06 22:06:18,989 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 11 [2023-11-06 22:06:18,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:18,989 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2023-11-06 22:06:18,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-06 22:06:18,990 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2023-11-06 22:06:18,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-06 22:06:18,991 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:18,991 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:18,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:06:18,992 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:06:18,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:18,993 INFO L85 PathProgramCache]: Analyzing trace with hash 65622039, now seen corresponding path program 1 times [2023-11-06 22:06:18,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:18,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385956617] [2023-11-06 22:06:18,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:18,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:19,103 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-06 22:06:19,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:19,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385956617] [2023-11-06 22:06:19,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385956617] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:19,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:19,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:06:19,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611842484] [2023-11-06 22:06:19,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:19,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:06:19,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:19,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:06:19,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:06:19,107 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-06 22:06:19,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:19,159 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2023-11-06 22:06:19,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:06:19,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2023-11-06 22:06:19,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:19,162 INFO L225 Difference]: With dead ends: 36 [2023-11-06 22:06:19,162 INFO L226 Difference]: Without dead ends: 30 [2023-11-06 22:06:19,165 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-06 22:06:19,167 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 3 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:19,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 81 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:06:19,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-06 22:06:19,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-06 22:06:19,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-06 22:06:19,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2023-11-06 22:06:19,184 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2023-11-06 22:06:19,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:19,185 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2023-11-06 22:06:19,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-06 22:06:19,185 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2023-11-06 22:06:19,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-06 22:06:19,187 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:19,187 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:19,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:06:19,188 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:06:19,189 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:19,190 INFO L85 PathProgramCache]: Analyzing trace with hash -659390950, now seen corresponding path program 1 times [2023-11-06 22:06:19,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:19,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386002683] [2023-11-06 22:06:19,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:19,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:19,226 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:06:19,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [737938876] [2023-11-06 22:06:19,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:19,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:06:19,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cef43f1-bd83-4b35-924a-7b32b9e1bded/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:06:19,239 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cef43f1-bd83-4b35-924a-7b32b9e1bded/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:06:19,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cef43f1-bd83-4b35-924a-7b32b9e1bded/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:06:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:19,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 22:06:19,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:06:19,494 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-06 22:06:19,494 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:06:19,557 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-06 22:06:19,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:19,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386002683] [2023-11-06 22:06:19,559 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:06:19,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737938876] [2023-11-06 22:06:19,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737938876] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:06:19,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:06:19,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2023-11-06 22:06:19,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183167540] [2023-11-06 22:06:19,560 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:06:19,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:06:19,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:19,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:06:19,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:06:19,563 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:19,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:19,652 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2023-11-06 22:06:19,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:06:19,653 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-06 22:06:19,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:19,654 INFO L225 Difference]: With dead ends: 37 [2023-11-06 22:06:19,655 INFO L226 Difference]: Without dead ends: 31 [2023-11-06 22:06:19,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:06:19,657 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 5 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:19,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 152 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:06:19,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-06 22:06:19,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-11-06 22:06:19,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-06 22:06:19,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2023-11-06 22:06:19,664 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 12 [2023-11-06 22:06:19,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:19,665 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2023-11-06 22:06:19,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:19,665 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2023-11-06 22:06:19,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-06 22:06:19,666 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:19,666 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:19,673 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cef43f1-bd83-4b35-924a-7b32b9e1bded/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-06 22:06:19,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cef43f1-bd83-4b35-924a-7b32b9e1bded/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:06:19,874 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:06:19,875 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:19,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1659957129, now seen corresponding path program 2 times [2023-11-06 22:06:19,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:19,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380697143] [2023-11-06 22:06:19,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:19,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:19,898 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:06:19,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [285079502] [2023-11-06 22:06:19,899 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:06:19,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:06:19,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cef43f1-bd83-4b35-924a-7b32b9e1bded/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:06:19,905 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cef43f1-bd83-4b35-924a-7b32b9e1bded/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:06:19,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cef43f1-bd83-4b35-924a-7b32b9e1bded/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:06:20,028 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:06:20,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:06:20,034 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-06 22:06:20,036 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:06:57,667 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-06 22:06:57,668 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:07:39,541 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-06 22:07:39,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:07:39,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380697143] [2023-11-06 22:07:39,542 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:07:39,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285079502] [2023-11-06 22:07:39,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285079502] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:07:39,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:07:39,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-11-06 22:07:39,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35504726] [2023-11-06 22:07:39,543 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:07:39,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-06 22:07:39,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:07:39,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-06 22:07:39,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=182, Unknown=14, NotChecked=0, Total=240 [2023-11-06 22:07:39,545 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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-06 22:07:52,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2023-11-06 22:07:55,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2023-11-06 22:07:57,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2023-11-06 22:08:13,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-06 22:08:25,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-06 22:08:26,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-06 22:08:28,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-06 22:08:33,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-06 22:08:57,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-06 22:08:58,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-06 22:09:00,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-06 22:09:02,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-06 22:09:05,279 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse10 (exists ((v_y_12 Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int) (v_z_12 Int) (v_y_11 Int)) (let ((.cse87 (* v_y_12 256)) (.cse88 (* v_z_12 255))) (let ((.cse85 (+ .cse87 .cse88)) (.cse86 (+ .cse87 .cse88 (* v_y_11 256)))) (and (<= .cse85 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse86) 0) (<= 0 .cse85) (<= .cse86 |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 v_z_12) (<= 0 .cse86) (<= v_z_12 255)))))) (.cse32 (exists ((v_z_3 Int) (v_y_3 Int) (v_y_2 Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse83 (* 255 v_z_3)) (.cse84 (* 256 v_y_3))) (let ((.cse81 (+ .cse83 (* 256 v_y_2) .cse84)) (.cse82 (+ .cse83 .cse84))) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse81) 0) (<= 128 v_z_3) (<= v_z_3 255) (<= 0 .cse81) (<= .cse82 255) (<= .cse81 |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 .cse82)))))) (.cse8 (exists ((v_y_7 Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int) (v_z_9 Int) (v_y_9 Int)) (let ((.cse79 (* 256 v_y_9)) (.cse80 (* 255 v_z_9))) (let ((.cse77 (+ .cse79 .cse80)) (.cse78 (+ .cse79 .cse80 (* 256 v_y_7)))) (and (<= 128 .cse77) (<= .cse78 |c_ULTIMATE.start_main1_~y~0#1|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse78) 0) (<= .cse77 255) (<= 0 v_z_9) (<= 0 .cse78) (<= v_z_9 127)))))) (.cse29 (exists ((v_y_4 Int) (v_y_6 Int) (v_z_6 Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse75 (* 256 v_y_6)) (.cse76 (* 255 v_z_6))) (let ((.cse74 (+ (* 256 v_y_4) .cse75 .cse76)) (.cse73 (+ .cse75 .cse76))) (and (<= .cse73 127) (<= v_z_6 127) (<= .cse74 |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 v_z_6) (not (= .cse74 0)) (<= 0 .cse74) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse74) 0) (<= 0 .cse73))))))) (and (let ((.cse9 (<= |c_ULTIMATE.start_main1_~g~0#1| 0)) (.cse4 (+ 256 |c_ULTIMATE.start_main1_~g~0#1|)) (.cse0 (<= |c_ULTIMATE.start_main1_~g~0#1| 127))) (or (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse2 (mod .cse1 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse1 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse2 127) (<= (mod (+ .cse1 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse2)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse5 (mod .cse3 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse3 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse4 .cse5) (<= (mod (+ .cse3 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (<= 128 .cse5))))) .cse0) (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse7 (mod .cse6 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse6 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse7 127) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse7) (<= 128 (mod (+ .cse6 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))))))) (and .cse8 .cse9) (and .cse10 .cse9) (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse12 (mod (+ .cse11 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (not (= .cse11 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse11 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= .cse4 .cse12) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse11 256) 127) (<= 128 .cse12) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse14 (mod (+ .cse13 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse13 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= .cse4 .cse14) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= 128 .cse14) (<= 128 (mod .cse13 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) .cse0) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse15 (mod (+ .cse16 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= |c_ULTIMATE.start_main1_~g~0#1| .cse15) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse16 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse15 127) (<= 128 (mod .cse16 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) .cse0) (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse18 (mod (+ .cse17 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (not (= .cse17 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse17 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= .cse4 .cse18) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse17 256) 127) (<= 128 .cse18) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse20 (mod (+ .cse19 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (not (= .cse19 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse20) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse19 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse19 256) 127) (<= .cse20 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) .cse0) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse22 (mod (+ .cse21 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (not (= .cse21 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse22) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse21 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse21 256) 127) (<= .cse22 127) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) .cse0) (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse24 (mod (+ .cse23 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse23 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= .cse4 .cse24) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= 128 .cse24) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)) (<= 128 (mod .cse23 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse26 (mod .cse25 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse25 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse4 .cse26) (<= 128 (mod (+ .cse25 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)) (<= 128 .cse26))))) .cse0) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse28 (mod .cse27 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse27 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse28 127) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse28) (<= 128 (mod (+ .cse27 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)))))) .cse0) (and .cse29 .cse9) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse31 (mod .cse30 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse30 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse31 127) (<= (mod (+ .cse30 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse31) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)))))) .cse0) (and .cse32 .cse9) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse33 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse34 (mod .cse33 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse33 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse4 .cse34) (<= 128 (mod (+ .cse33 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)) (<= 128 .cse34))))) .cse0) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse36 (mod .cse35 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse35 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse4 .cse36) (<= (mod (+ .cse35 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (<= 128 .cse36))))) .cse0) (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse38 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse37 (mod (+ .cse38 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= |c_ULTIMATE.start_main1_~g~0#1| .cse37) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse38 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse37 127) (<= 128 (mod .cse38 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0)))))))) (let ((.cse43 (+ 256 |c_ULTIMATE.start_gcd_test_#res#1|)) (.cse48 (<= |c_ULTIMATE.start_gcd_test_#res#1| 0))) (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse39 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse40 (mod (+ .cse39 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse39 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse40 127) (<= |c_ULTIMATE.start_gcd_test_#res#1| .cse40) (<= 128 (mod .cse39 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse41 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse42 (mod (+ .cse41 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (not (= .cse41 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse41 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse41 256) 127) (<= 128 .cse42) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0) (<= .cse43 .cse42))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse44 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse45 (mod .cse44 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse44 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse45 127) (<= 128 (mod (+ .cse44 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)) (<= |c_ULTIMATE.start_gcd_test_#res#1| .cse45))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse46 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse47 (mod (+ .cse46 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (not (= .cse46 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse46 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse46 256) 127) (<= .cse47 127) (<= |c_ULTIMATE.start_gcd_test_#res#1| .cse47) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (and .cse10 .cse48) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse49 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse50 (mod (+ .cse49 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse49 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse50 127) (<= |c_ULTIMATE.start_gcd_test_#res#1| .cse50) (<= 128 (mod .cse49 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse51 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse52 (mod (+ .cse51 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (not (= .cse51 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse51 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse51 256) 127) (<= .cse52 127) (<= |c_ULTIMATE.start_gcd_test_#res#1| .cse52) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse53 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse54 (mod (+ .cse53 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse53 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= 128 .cse54) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)) (<= 128 (mod .cse53 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0) (<= .cse43 .cse54))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse55 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse56 (mod .cse55 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse55 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse56 127) (<= (mod (+ .cse55 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (<= |c_ULTIMATE.start_gcd_test_#res#1| .cse56))))) (and .cse32 .cse48) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse57 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse58 (mod .cse57 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse57 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse43 .cse58) (<= 128 (mod (+ .cse57 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)) (<= 128 .cse58))))) (and .cse8 .cse48) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse59 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse60 (mod (+ .cse59 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (not (= .cse59 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse59 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse59 256) 127) (<= 128 .cse60) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0) (<= .cse43 .cse60))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse61 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse62 (mod .cse61 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse61 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse43 .cse62) (<= 128 (mod (+ .cse61 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)) (<= 128 .cse62))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse63 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse64 (mod .cse63 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse63 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse64 127) (<= 128 (mod (+ .cse63 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)) (<= |c_ULTIMATE.start_gcd_test_#res#1| .cse64))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse65 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse66 (mod (+ .cse65 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse65 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= 128 .cse66) (<= 128 (mod .cse65 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0) (<= .cse43 .cse66))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse67 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse68 (mod .cse67 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse67 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse43 .cse68) (<= (mod (+ .cse67 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (<= 128 .cse68))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse69 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse70 (mod .cse69 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse69 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse43 .cse70) (<= (mod (+ .cse69 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (<= 128 .cse70))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse71 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse72 (mod .cse71 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse71 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse72 127) (<= (mod (+ .cse71 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)) (<= |c_ULTIMATE.start_gcd_test_#res#1| .cse72))))) (and .cse29 .cse48))))) is different from false [2023-11-06 22:09:15,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-11-06 22:09:17,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-11-06 22:09:17,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:09:17,642 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2023-11-06 22:09:17,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:09:17,643 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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 13 [2023-11-06 22:09:17,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:09:17,644 INFO L225 Difference]: With dead ends: 43 [2023-11-06 22:09:17,644 INFO L226 Difference]: Without dead ends: 33 [2023-11-06 22:09:17,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 115.4s TimeCoverageRelationStatistics Valid=109, Invalid=414, Unknown=33, NotChecked=44, Total=600 [2023-11-06 22:09:17,646 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 15 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 33.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:09:17,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 226 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 72 Invalid, 12 Unknown, 13 Unchecked, 33.8s Time] [2023-11-06 22:09:17,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-06 22:09:17,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-11-06 22:09:17,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-06 22:09:17,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2023-11-06 22:09:17,665 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 13 [2023-11-06 22:09:17,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:09:17,666 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2023-11-06 22:09:17,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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-06 22:09:17,666 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2023-11-06 22:09:17,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-06 22:09:17,667 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:09:17,667 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:17,672 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cef43f1-bd83-4b35-924a-7b32b9e1bded/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-06 22:09:17,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cef43f1-bd83-4b35-924a-7b32b9e1bded/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:09:17,868 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:09:17,868 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:17,869 INFO L85 PathProgramCache]: Analyzing trace with hash -2084161321, now seen corresponding path program 3 times [2023-11-06 22:09:17,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:17,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533326406] [2023-11-06 22:09:17,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:17,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:17,879 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:09:17,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1393113938] [2023-11-06 22:09:17,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:09:17,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:09:17,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cef43f1-bd83-4b35-924a-7b32b9e1bded/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:09:17,881 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cef43f1-bd83-4b35-924a-7b32b9e1bded/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:09:17,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cef43f1-bd83-4b35-924a-7b32b9e1bded/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:09:17,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-06 22:09:17,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:09:17,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-06 22:09:17,979 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:20,036 WARN L293 SmtUtils]: Spent 5.12s on a formula simplification that was a NOOP. DAG size: 105 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)