./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_2+newton_3_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b 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_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/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_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_3_1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/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_48e59bb8-ab52-4ebf-aa15-8591ed169788/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 613ee8845912b921567ac9e82f8c414d8758c61c69ed2c2ac2cbc303a1b4f001 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:21:14,462 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:21:14,570 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:21:14,578 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:21:14,579 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:21:14,621 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:21:14,624 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:21:14,624 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:21:14,625 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:21:14,630 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:21:14,632 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:21:14,632 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:21:14,633 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:21:14,635 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:21:14,635 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:21:14,636 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:21:14,636 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:21:14,637 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:21:14,637 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:21:14,638 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:21:14,638 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:21:14,639 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:21:14,639 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:21:14,639 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:21:14,640 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:21:14,641 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:21:14,641 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:21:14,642 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:21:14,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:21:14,643 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:21:14,644 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:21:14,644 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:21:14,644 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:21:14,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:21:14,645 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:21:14,645 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:21:14,645 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:21:14,646 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:21:14,646 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:21:14,646 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_48e59bb8-ab52-4ebf-aa15-8591ed169788/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_48e59bb8-ab52-4ebf-aa15-8591ed169788/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 -> 613ee8845912b921567ac9e82f8c414d8758c61c69ed2c2ac2cbc303a1b4f001 [2023-11-06 22:21:15,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:21:15,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:21:15,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:21:15,043 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:21:15,044 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:21:15,045 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/combinations/gcd_2+newton_3_1.i [2023-11-06 22:21:18,196 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:21:18,425 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:21:18,425 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/sv-benchmarks/c/combinations/gcd_2+newton_3_1.i [2023-11-06 22:21:18,435 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/data/1b7e43f84/0ac0184a83f24a99b24eb3c1a66c8365/FLAG3f591a473 [2023-11-06 22:21:18,452 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/data/1b7e43f84/0ac0184a83f24a99b24eb3c1a66c8365 [2023-11-06 22:21:18,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:21:18,461 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:21:18,464 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:21:18,464 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:21:18,470 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:21:18,472 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:21:18" (1/1) ... [2023-11-06 22:21:18,474 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dbf6462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:18, skipping insertion in model container [2023-11-06 22:21:18,474 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:21:18" (1/1) ... [2023-11-06 22:21:18,506 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:21:18,707 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_48e59bb8-ab52-4ebf-aa15-8591ed169788/sv-benchmarks/c/combinations/gcd_2+newton_3_1.i[1226,1239] [2023-11-06 22:21:18,737 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_48e59bb8-ab52-4ebf-aa15-8591ed169788/sv-benchmarks/c/combinations/gcd_2+newton_3_1.i[2862,2875] [2023-11-06 22:21:18,749 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:21:18,759 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:21:18,777 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_48e59bb8-ab52-4ebf-aa15-8591ed169788/sv-benchmarks/c/combinations/gcd_2+newton_3_1.i[1226,1239] [2023-11-06 22:21:18,789 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_48e59bb8-ab52-4ebf-aa15-8591ed169788/sv-benchmarks/c/combinations/gcd_2+newton_3_1.i[2862,2875] [2023-11-06 22:21:18,790 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:21:18,806 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:21:18,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:18 WrapperNode [2023-11-06 22:21:18,807 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:21:18,808 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:21:18,808 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:21:18,808 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:21:18,816 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:21:18" (1/1) ... [2023-11-06 22:21:18,834 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:21:18" (1/1) ... [2023-11-06 22:21:18,871 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 93 [2023-11-06 22:21:18,874 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:21:18,875 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:21:18,876 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:21:18,876 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:21:18,884 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:18" (1/1) ... [2023-11-06 22:21:18,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:18" (1/1) ... [2023-11-06 22:21:18,887 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:18" (1/1) ... [2023-11-06 22:21:18,887 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:18" (1/1) ... [2023-11-06 22:21:18,893 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:18" (1/1) ... [2023-11-06 22:21:18,897 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:18" (1/1) ... [2023-11-06 22:21:18,910 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:18" (1/1) ... [2023-11-06 22:21:18,911 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:18" (1/1) ... [2023-11-06 22:21:18,914 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:21:18,915 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:21:18,915 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:21:18,915 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:21:18,916 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:18" (1/1) ... [2023-11-06 22:21:18,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:21:18,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:21:18,956 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/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:21:18,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/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:21:18,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:21:18,994 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2023-11-06 22:21:18,994 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2023-11-06 22:21:18,994 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-11-06 22:21:18,994 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-11-06 22:21:18,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:21:18,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:21:18,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:21:19,069 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:21:19,072 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:21:19,297 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:21:19,303 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:21:19,303 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:21:19,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:21:19 BoogieIcfgContainer [2023-11-06 22:21:19,306 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:21:19,322 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:21:19,322 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:21:19,331 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:21:19,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:21:18" (1/3) ... [2023-11-06 22:21:19,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f32dd91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:21:19, skipping insertion in model container [2023-11-06 22:21:19,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:18" (2/3) ... [2023-11-06 22:21:19,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f32dd91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:21:19, skipping insertion in model container [2023-11-06 22:21:19,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:21:19" (3/3) ... [2023-11-06 22:21:19,335 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_3_1.i [2023-11-06 22:21:19,355 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:21:19,355 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-06 22:21:19,408 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:21:19,414 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;@189bef96, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:21:19,415 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-06 22:21:19,419 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 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-06 22:21:19,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-06 22:21:19,427 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:21:19,427 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:21:19,428 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:21:19,433 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:19,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2023-11-06 22:21:19,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:19,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352856066] [2023-11-06 22:21:19,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:19,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:19,820 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:21:19,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:21:19,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352856066] [2023-11-06 22:21:19,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352856066] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:21:19,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:21:19,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:21:19,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883922163] [2023-11-06 22:21:19,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:21:19,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:21:19,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:21:19,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:21:19,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:21:19,863 INFO L87 Difference]: Start difference. First operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 4 states have (on average 2.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:21:19,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:21:19,947 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions. [2023-11-06 22:21:19,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:21:19,950 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:21:19,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:21:19,957 INFO L225 Difference]: With dead ends: 83 [2023-11-06 22:21:19,957 INFO L226 Difference]: Without dead ends: 35 [2023-11-06 22:21:19,961 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:21:19,964 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 120 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:21:19,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 120 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:21:19,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-06 22:21:20,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2023-11-06 22:21:20,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:21:20,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2023-11-06 22:21:20,008 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 11 [2023-11-06 22:21:20,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:21:20,009 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2023-11-06 22:21:20,009 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:21:20,010 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2023-11-06 22:21:20,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-06 22:21:20,011 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:21:20,011 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:21:20,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:21:20,012 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:21:20,013 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:20,013 INFO L85 PathProgramCache]: Analyzing trace with hash 65622039, now seen corresponding path program 1 times [2023-11-06 22:21:20,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:20,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271377825] [2023-11-06 22:21:20,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:20,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:20,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:20,135 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:21:20,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:21:20,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271377825] [2023-11-06 22:21:20,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271377825] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:21:20,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:21:20,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:21:20,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624621237] [2023-11-06 22:21:20,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:21:20,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:21:20,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:21:20,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:21:20,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:21:20,143 INFO L87 Difference]: Start difference. First operand 32 states and 37 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:21:20,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:21:20,177 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2023-11-06 22:21:20,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:21:20,178 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:21:20,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:21:20,180 INFO L225 Difference]: With dead ends: 39 [2023-11-06 22:21:20,180 INFO L226 Difference]: Without dead ends: 33 [2023-11-06 22:21:20,181 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:21:20,182 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 3 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 96 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:21:20,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 96 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:21:20,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-06 22:21:20,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-11-06 22:21:20,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 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-06 22:21:20,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2023-11-06 22:21:20,193 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 11 [2023-11-06 22:21:20,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:21:20,193 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2023-11-06 22:21:20,194 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:21:20,194 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2023-11-06 22:21:20,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-06 22:21:20,195 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:21:20,195 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:21:20,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:21:20,196 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:21:20,197 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:20,197 INFO L85 PathProgramCache]: Analyzing trace with hash -659390950, now seen corresponding path program 1 times [2023-11-06 22:21:20,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:20,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104085095] [2023-11-06 22:21:20,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:20,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:20,214 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:21:20,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1464789742] [2023-11-06 22:21:20,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:20,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:21:20,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:21:20,228 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:21:20,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:21:20,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:20,345 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 22:21:20,350 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:21:20,476 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:21:20,476 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:21:20,553 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:21:20,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:21:20,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104085095] [2023-11-06 22:21:20,554 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:21:20,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464789742] [2023-11-06 22:21:20,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464789742] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:21:20,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:21:20,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2023-11-06 22:21:20,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583548562] [2023-11-06 22:21:20,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:21:20,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:21:20,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:21:20,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:21:20,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:21:20,558 INFO L87 Difference]: Start difference. First operand 33 states and 38 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:21:20,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:21:20,642 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2023-11-06 22:21:20,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:21:20,643 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:21:20,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:21:20,644 INFO L225 Difference]: With dead ends: 40 [2023-11-06 22:21:20,644 INFO L226 Difference]: Without dead ends: 34 [2023-11-06 22:21:20,645 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:21:20,647 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 182 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:21:20,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 182 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:21:20,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-06 22:21:20,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-11-06 22:21:20,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 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-06 22:21:20,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2023-11-06 22:21:20,655 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 12 [2023-11-06 22:21:20,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:21:20,655 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2023-11-06 22:21:20,656 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:21:20,656 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2023-11-06 22:21:20,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-06 22:21:20,657 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:21:20,657 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:21:20,668 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:21:20,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:21:20,863 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:21:20,863 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:20,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1659957129, now seen corresponding path program 2 times [2023-11-06 22:21:20,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:20,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117781022] [2023-11-06 22:21:20,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:20,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:20,890 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:21:20,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [154133622] [2023-11-06 22:21:20,890 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:21:20,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:21:20,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:21:20,900 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:21:20,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:21:21,002 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:21:21,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:21:21,004 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-06 22:21:21,006 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:21:55,801 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:21:55,801 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:22:36,367 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:22:36,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:22:36,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117781022] [2023-11-06 22:22:36,368 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:22:36,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154133622] [2023-11-06 22:22:36,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154133622] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:22:36,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:22:36,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-11-06 22:22:36,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104808551] [2023-11-06 22:22:36,369 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:22:36,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-06 22:22:36,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:22:36,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-06 22:22:36,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=183, Unknown=14, NotChecked=0, Total=240 [2023-11-06 22:22:36,373 INFO L87 Difference]: Start difference. First operand 34 states and 39 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:22:39,563 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main1_~y~0#1| 1)) (.cse1 (< 126 |c_ULTIMATE.start_main1_~y~0#1|))) (and (or (< |c_ULTIMATE.start_gcd_test_~a#1| .cse0) .cse1) (or (let ((.cse6 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (let ((.cse72 (mod |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse73 (mod .cse6 256))) (let ((.cse58 (< .cse73 128)) (.cse4 (+ 257 |c_ULTIMATE.start_main1_~y~0#1|)) (.cse59 (< .cse72 128)) (.cse56 (< 0 .cse0)) (.cse67 (< 127 .cse73)) (.cse64 (< 127 .cse72)) (.cse57 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (not (= (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|) 0))))) (let ((.cse9 (or .cse56 .cse67 .cse64 .cse57)) (.cse10 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse71 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse70 (mod .cse71 256))) (or (< .cse70 .cse0) (< 127 (mod (+ .cse71 .cse6) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse70) (< 127 (mod (+ .cse71 |c_ULTIMATE.start_gcd_test_~b#1|) 256))))))) (.cse19 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse69 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse68 (mod .cse69 256))) (or (< .cse68 .cse0) (< (mod (+ .cse69 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod (+ .cse69 .cse6) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse68)))))) (.cse22 (or .cse56 .cse67 .cse57 .cse59)) (.cse2 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse66 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse65 (mod .cse66 256))) (or (< .cse65 .cse4) (< .cse65 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse66 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse66 .cse6) 256) 128)))))) (.cse36 (or .cse56 .cse64 .cse57 .cse58)) (.cse37 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse63 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse62 (mod .cse63 256))) (or (< .cse62 .cse0) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse62) (< 127 (mod (+ .cse63 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse63 .cse6) 256) 128)))))) (.cse27 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse61 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse60 (mod .cse61 256))) (or (< .cse60 .cse4) (< .cse60 128) (< (mod (+ .cse61 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod (+ .cse61 .cse6) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (.cse13 (or .cse56 .cse57 .cse58 .cse59)) (.cse14 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse55 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse54 (mod .cse55 256))) (or (< .cse54 .cse0) (< (mod (+ .cse55 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse54) (< (mod (+ .cse55 .cse6) 256) 128)))))) (.cse7 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse33 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse53 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse52 (mod .cse53 256))) (or (< .cse52 .cse4) (< .cse52 128) (< 127 (mod (+ .cse53 .cse6) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse53 |c_ULTIMATE.start_gcd_test_~b#1|) 256))))))) (.cse8 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse30 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse51 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse50 (mod .cse51 256))) (or (< .cse50 .cse4) (< .cse50 128) (< (mod (+ .cse51 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< (mod (+ .cse51 .cse6) 256) 128))))))) (and (or (and .cse2 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse5 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse3 (mod (+ .cse5 .cse6) 256))) (or (< .cse3 .cse4) (< (mod .cse5 256) 128) (< 127 (mod (+ .cse5 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse3 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) .cse7) (or .cse8 (and .cse9 .cse10 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse12 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse11 (mod (+ .cse12 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse11 .cse0) (< 127 (mod (+ .cse12 .cse6) 256)) (< 127 (mod .cse12 256)) (< 127 .cse11) (= .cse12 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse8 (and .cse13 .cse14 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse16 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse15 (mod (+ .cse16 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse15 128) (< .cse15 .cse4) (< 127 (mod .cse16 256)) (< (mod (+ .cse16 .cse6) 256) 128) (= .cse16 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse7 (and .cse9 .cse10 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse18 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse17 (mod (+ .cse18 .cse6) 256))) (or (< 127 .cse17) (< .cse17 .cse0) (< 127 (mod .cse18 256)) (< 127 (mod (+ .cse18 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (= .cse18 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or (and .cse19 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse20 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse21 (mod (+ .cse20 .cse6) 256))) (or (< (mod (+ .cse20 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 .cse21) (< .cse21 .cse0) (< 127 (mod .cse20 256)) (= .cse20 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse22) .cse7) (or .cse8 (and .cse19 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse24 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse23 (mod (+ .cse24 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse23 128) (< .cse23 .cse4) (< 127 (mod (+ .cse24 .cse6) 256)) (< 127 (mod .cse24 256)) (= .cse24 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse22)) (or .cse8 (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse25 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse26 (mod (+ .cse25 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse25 256) 128) (< .cse26 128) (< .cse26 .cse4) (< 127 (mod (+ .cse25 .cse6) 256)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse27)) (or .cse7 (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse29 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse28 (mod (+ .cse29 .cse6) 256))) (or (< .cse28 .cse4) (< (mod .cse29 256) 128) (< (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< .cse28 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse30)) (or .cse8 (and .cse2 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse31 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse32 (mod (+ .cse31 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse31 256) 128) (< .cse32 .cse0) (< 127 .cse32) (< (mod (+ .cse31 .cse6) 256) 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse8 (and .cse33 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse34 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse35 (mod (+ .cse34 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse34 256) 128) (< .cse35 .cse0) (< 127 (mod (+ .cse34 .cse6) 256)) (< 127 .cse35) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse8 (and .cse36 .cse37 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse39 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse38 (mod (+ .cse39 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse38 .cse0) (< 127 (mod .cse39 256)) (< 127 .cse38) (< (mod (+ .cse39 .cse6) 256) 128) (= .cse39 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse7 (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse41 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse40 (mod (+ .cse41 .cse6) 256))) (or (< .cse40 .cse4) (< 127 (mod .cse41 256)) (< 127 (mod (+ .cse41 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse40 128) (= .cse41 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse36 .cse37)) (or (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse42 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse43 (mod (+ .cse42 .cse6) 256))) (or (< (mod .cse42 256) 128) (< (mod (+ .cse42 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 .cse43) (< .cse43 .cse0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse27) .cse7) (or .cse7 (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse45 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse44 (mod (+ .cse45 .cse6) 256))) (or (< .cse44 .cse4) (< (mod (+ .cse45 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod .cse45 256)) (< .cse44 128) (= .cse45 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse13 .cse14)) (or .cse7 (and .cse33 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse46 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse47 (mod (+ .cse46 .cse6) 256))) (or (< (mod .cse46 256) 128) (< 127 .cse47) (< .cse47 .cse0) (< 127 (mod (+ .cse46 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse8 (and .cse30 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse48 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse49 (mod (+ .cse48 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse48 256) 128) (< .cse49 128) (< .cse49 .cse4) (< (mod (+ .cse48 .cse6) 256) 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))))))) .cse1 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (let ((.cse87 (<= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse76 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256))) (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse74 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse75 (mod (+ .cse74 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= 128 (mod (+ .cse74 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 128 .cse75) (<= 128 (mod .cse74 256)) (<= .cse76 .cse75) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse77 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse78 (mod (+ .cse77 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (not (= .cse77 0)) (<= 128 (mod (+ .cse77 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= (mod .cse77 256) 127) (<= 128 .cse78) (<= .cse76 .cse78) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse80 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse79 (mod (+ .cse80 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse79) (not (= .cse80 0)) (<= (mod (+ .cse80 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= (mod .cse80 256) 127) (<= .cse79 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse81 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse82 (mod (+ .cse81 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= (mod (+ .cse81 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 128 .cse82) (<= 128 (mod .cse81 256)) (<= .cse76 .cse82) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse84 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse83 (mod (+ .cse84 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse83) (not (= .cse84 0)) (<= 128 (mod (+ .cse84 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= (mod .cse84 256) 127) (<= .cse83 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse85 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse86 (mod .cse85 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= 128 (mod (+ .cse85 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= .cse76 .cse86) (<= 128 (mod (+ .cse85 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)) (<= 128 .cse86))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)))) (and .cse87 (exists ((v_y_4 Int) (v_y_6 Int) (v_z_6 Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse90 (* 256 v_y_6)) (.cse91 (* 255 v_z_6))) (let ((.cse89 (+ (* 256 v_y_4) .cse90 .cse91)) (.cse88 (+ .cse90 .cse91))) (and (<= .cse88 127) (<= v_z_6 127) (<= .cse89 |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 v_z_6) (not (= .cse89 0)) (<= 0 .cse89) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse89) 0) (<= 0 .cse88)))))) (and (exists ((v_z_3 Int) (v_y_3 Int) (v_y_2 Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse94 (* 255 v_z_3)) (.cse95 (* 256 v_y_3))) (let ((.cse92 (+ .cse94 (* 256 v_y_2) .cse95)) (.cse93 (+ .cse94 .cse95))) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse92) 0) (<= 128 v_z_3) (<= v_z_3 255) (<= 0 .cse92) (<= .cse93 255) (<= .cse92 |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 .cse93))))) .cse87) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse97 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse96 (mod .cse97 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse96) (<= (mod (+ .cse97 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= .cse96 127) (<= 128 (mod (+ .cse97 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)))))) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)))) (and (exists ((v_y_7 Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int) (v_z_9 Int) (v_y_9 Int)) (let ((.cse100 (* 256 v_y_9)) (.cse101 (* 255 v_z_9))) (let ((.cse98 (+ .cse100 .cse101)) (.cse99 (+ .cse100 .cse101 (* 256 v_y_7)))) (and (<= 128 .cse98) (<= .cse99 |c_ULTIMATE.start_main1_~y~0#1|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse99) 0) (<= .cse98 255) (<= 0 v_z_9) (<= 0 .cse99) (<= v_z_9 127))))) .cse87) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse103 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse102 (mod (+ .cse103 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse102) (<= (mod (+ .cse103 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= .cse102 127) (<= 128 (mod .cse103 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse105 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse104 (mod .cse105 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse104) (<= (mod (+ .cse105 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= .cse104 127) (<= (mod (+ .cse105 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127))))) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse107 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse106 (mod .cse107 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse106) (<= 128 (mod (+ .cse107 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= .cse106 127) (<= (mod (+ .cse107 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127))))) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)))) (and .cse87 (exists ((v_y_12 Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int) (v_z_12 Int) (v_y_11 Int)) (let ((.cse110 (* v_y_12 256)) (.cse111 (* v_z_12 255))) (let ((.cse108 (+ .cse110 .cse111)) (.cse109 (+ .cse110 .cse111 (* v_y_11 256)))) (and (<= .cse108 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse109) 0) (<= 0 .cse108) (<= .cse109 |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 v_z_12) (<= 0 .cse109) (<= v_z_12 255)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse113 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse112 (mod .cse113 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse112) (<= 128 (mod (+ .cse113 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= .cse112 127) (<= 128 (mod (+ .cse113 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse114 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse115 (mod .cse114 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= (mod (+ .cse114 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= .cse76 .cse115) (<= 128 (mod (+ .cse114 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)) (<= 128 .cse115))))) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse116 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse117 (mod (+ .cse116 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (not (= .cse116 0)) (<= (mod (+ .cse116 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= (mod .cse116 256) 127) (<= 128 .cse117) (<= .cse76 .cse117) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse119 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse118 (mod (+ .cse119 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= |c_ULTIMATE.start_gcd_test_~b#1| .cse118) (<= 128 (mod (+ .cse119 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= .cse118 127) (<= 128 (mod .cse119 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse120 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse121 (mod .cse120 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= (mod (+ .cse120 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= .cse76 .cse121) (<= (mod (+ .cse120 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (<= 128 .cse121))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse122 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse123 (mod .cse122 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= 128 (mod (+ .cse122 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= .cse76 .cse123) (<= (mod (+ .cse122 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (<= 128 .cse123))))) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)))))))) is different from true [2023-11-06 22:22:48,650 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:22:50,830 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:23:00,372 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:23:05,244 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:23:07,279 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse28 (exists ((v_y_12 Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int) (v_z_12 Int) (v_y_11 Int)) (let ((.cse86 (* v_y_12 256)) (.cse87 (* v_z_12 255))) (let ((.cse84 (+ .cse86 .cse87)) (.cse85 (+ .cse86 .cse87 (* v_y_11 256)))) (and (<= .cse84 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse85) 0) (<= 0 .cse84) (<= .cse85 |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 v_z_12) (<= 0 .cse85) (<= v_z_12 255)))))) (.cse17 (exists ((v_z_3 Int) (v_y_3 Int) (v_y_2 Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse82 (* 255 v_z_3)) (.cse83 (* 256 v_y_3))) (let ((.cse80 (+ .cse82 (* 256 v_y_2) .cse83)) (.cse81 (+ .cse82 .cse83))) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse80) 0) (<= 128 v_z_3) (<= v_z_3 255) (<= 0 .cse80) (<= .cse81 255) (<= .cse80 |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 .cse81)))))) (.cse31 (exists ((v_y_7 Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int) (v_z_9 Int) (v_y_9 Int)) (let ((.cse78 (* 256 v_y_9)) (.cse79 (* 255 v_z_9))) (let ((.cse76 (+ .cse78 .cse79)) (.cse77 (+ .cse78 .cse79 (* 256 v_y_7)))) (and (<= 128 .cse76) (<= .cse77 |c_ULTIMATE.start_main1_~y~0#1|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse77) 0) (<= .cse76 255) (<= 0 v_z_9) (<= 0 .cse77) (<= v_z_9 127)))))) (.cse3 (exists ((v_y_4 Int) (v_y_6 Int) (v_z_6 Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse74 (* 256 v_y_6)) (.cse75 (* 255 v_z_6))) (let ((.cse73 (+ (* 256 v_y_4) .cse74 .cse75)) (.cse72 (+ .cse74 .cse75))) (and (<= .cse72 127) (<= v_z_6 127) (<= .cse73 |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 v_z_6) (not (= .cse73 0)) (<= 0 .cse73) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse73) 0) (<= 0 .cse72))))))) (and (<= |c_ULTIMATE.start_gcd_test_~b#1| |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 |c_ULTIMATE.start_gcd_test_~b#1|) (let ((.cse2 (<= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse4 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256))) (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse1 (mod .cse0 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 (+ .cse0 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse1) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse1 127) (<= 128 (mod (+ .cse0 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)))))) (and .cse2 .cse3) (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 ((.cse5 (mod .cse6 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= .cse4 .cse5) (<= |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|) (<= 128 (mod (+ .cse6 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)) (<= 128 .cse5))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse8 (mod (+ .cse7 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (not (= .cse7 0)) (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse8) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse7 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse7 256) 127) (<= .cse8 127) (<= (+ |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 ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse9 (mod (+ .cse10 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse9) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse10 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse9 127) (<= 128 (mod .cse10 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 ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse11 (mod .cse12 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= .cse4 .cse11) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse12 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod (+ .cse12 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (<= 128 .cse11))))) (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 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 (+ .cse13 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse14) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse14 127) (<= 128 (mod (+ .cse13 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)))))) (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 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= .cse4 .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|) (<= (mod (+ .cse16 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (<= 128 .cse15))))) (and .cse2 .cse17) (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 ((.cse18 (mod (+ .cse19 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= .cse4 .cse18) (not (= .cse19 0)) (<= |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) (<= 128 .cse18) (<= (+ |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 ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse21 (mod .cse20 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 (+ .cse20 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse21) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse21 127) (<= (mod (+ .cse20 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127))))) (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 ((.cse22 (mod .cse23 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= .cse4 .cse22) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse23 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= 128 (mod (+ .cse23 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)) (<= 128 .cse22))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse25 (mod .cse24 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 (+ .cse24 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse25) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse25 127) (<= (mod (+ .cse24 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse27 (mod (+ .cse26 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (not (= .cse26 0)) (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse27) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse26 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse26 256) 127) (<= .cse27 127) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (and .cse2 .cse28) (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 ((.cse29 (mod (+ .cse30 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= .cse4 .cse29) (not (= .cse30 0)) (<= |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|) (<= (mod .cse30 256) 127) (<= 128 .cse29) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (and .cse31 .cse2) (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 ((.cse32 (mod (+ .cse33 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= .cse4 .cse32) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse33 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= 128 .cse32) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)) (<= 128 (mod .cse33 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 ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse34 (mod (+ .cse35 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= .cse4 .cse34) (<= |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|) (<= 128 .cse34) (<= 128 (mod .cse35 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 ((.cse37 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse36 (mod (+ .cse37 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| .cse36) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse37 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse36 127) (<= 128 (mod .cse37 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))))) (let ((.cse42 (+ 256 |c_ULTIMATE.start_gcd_test_#res#1|)) (.cse47 (<= |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 ((.cse38 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse39 (mod (+ .cse38 (* 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 (+ .cse38 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse39 127) (<= |c_ULTIMATE.start_gcd_test_#res#1| .cse39) (<= 128 (mod .cse38 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 ((.cse40 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse41 (mod (+ .cse40 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (not (= .cse40 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse40 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse40 256) 127) (<= 128 .cse41) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0) (<= .cse42 .cse41))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse43 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse44 (mod .cse43 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 (+ .cse43 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse44 127) (<= 128 (mod (+ .cse43 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)) (<= |c_ULTIMATE.start_gcd_test_#res#1| .cse44))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse46 (mod (+ .cse45 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (not (= .cse45 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse45 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse45 256) 127) (<= .cse46 127) (<= |c_ULTIMATE.start_gcd_test_#res#1| .cse46) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0))))) (and .cse28 .cse47) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse48 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse49 (mod (+ .cse48 (* 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 (+ .cse48 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse49 127) (<= |c_ULTIMATE.start_gcd_test_#res#1| .cse49) (<= 128 (mod .cse48 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 ((.cse50 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse51 (mod (+ .cse50 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (not (= .cse50 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse50 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse50 256) 127) (<= .cse51 127) (<= |c_ULTIMATE.start_gcd_test_#res#1| .cse51) (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 ((.cse52 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse53 (mod (+ .cse52 (* 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 (+ .cse52 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= 128 .cse53) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)) (<= 128 (mod .cse52 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0) (<= .cse42 .cse53))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse54 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse55 (mod .cse54 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 (+ .cse54 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse55 127) (<= (mod (+ .cse54 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (<= |c_ULTIMATE.start_gcd_test_#res#1| .cse55))))) (and .cse17 .cse47) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse56 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse57 (mod .cse56 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 (+ .cse56 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse42 .cse57) (<= 128 (mod (+ .cse56 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_13| 0)) (<= 128 .cse57))))) (and .cse31 .cse47) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse58 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse59 (mod (+ .cse58 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256))) (and (not (= .cse58 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_13| |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 (mod (+ .cse58 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= (mod .cse58 256) 127) (<= 128 .cse59) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0) (<= .cse42 .cse59))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse60 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse61 (mod .cse60 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 (+ .cse60 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse42 .cse61) (<= 128 (mod (+ .cse60 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)) (<= 128 .cse61))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse62 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse63 (mod .cse62 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 (+ .cse62 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse63 127) (<= 128 (mod (+ .cse62 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256)) (<= |c_ULTIMATE.start_gcd_test_#res#1| .cse63))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse64 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse65 (mod (+ .cse64 (* 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 (+ .cse64 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= 128 .cse65) (<= 128 (mod .cse64 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_14| 1) 0) (<= .cse42 .cse65))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse66 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse67 (mod .cse66 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 (+ .cse66 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse42 .cse67) (<= (mod (+ .cse66 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (<= 128 .cse67))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse68 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse69 (mod .cse68 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 (+ .cse68 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse42 .cse69) (<= (mod (+ .cse68 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|)) 256) 127) (<= 128 .cse69))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse70 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |v_ULTIMATE.start_gcd_test_~b#1_13|))) (let ((.cse71 (mod .cse70 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 (+ .cse70 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_13|) (<= .cse71 127) (<= (mod (+ .cse70 (* 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| .cse71))))) (and .cse3 .cse47))))) is different from false [2023-11-06 22:23:32,677 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:23:35,183 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:23:51,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-11-06 22:23:53,977 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:23:54,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:23:54,859 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2023-11-06 22:23:54,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:23:54,860 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:23:54,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:23:54,861 INFO L225 Difference]: With dead ends: 46 [2023-11-06 22:23:54,861 INFO L226 Difference]: Without dead ends: 36 [2023-11-06 22:23:54,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 104.8s TimeCoverageRelationStatistics Valid=98, Invalid=436, Unknown=26, NotChecked=90, Total=650 [2023-11-06 22:23:54,863 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 18 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 9 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 23.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:23:54,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 270 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 76 Invalid, 7 Unknown, 25 Unchecked, 23.0s Time] [2023-11-06 22:23:54,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-06 22:23:54,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-11-06 22:23:54,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 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-06 22:23:54,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2023-11-06 22:23:54,883 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 13 [2023-11-06 22:23:54,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:23:54,884 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2023-11-06 22:23:54,884 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:23:54,884 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2023-11-06 22:23:54,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-06 22:23:54,885 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:23:54,885 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:54,894 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-06 22:23:55,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:23:55,089 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:23:55,090 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:55,090 INFO L85 PathProgramCache]: Analyzing trace with hash -2084161321, now seen corresponding path program 3 times [2023-11-06 22:23:55,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:55,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727869292] [2023-11-06 22:23:55,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:55,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:55,103 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:23:55,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [755316149] [2023-11-06 22:23:55,103 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:23:55,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:23:55,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:23:55,105 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:23:55,117 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:23:55,198 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-06 22:23:55,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:23:55,200 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-06 22:23:55,202 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:24:02,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 139 [2023-11-06 22:24:02,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:02,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727869292] [2023-11-06 22:24:02,596 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:24:02,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755316149] [2023-11-06 22:24:02,596 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-06 22:24:02,601 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:24:02,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:24:02,797 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:900) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:774) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:362) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:311) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:579) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 44 more [2023-11-06 22:24:02,802 INFO L158 Benchmark]: Toolchain (without parser) took 164340.81ms. Allocated memory was 123.7MB in the beginning and 237.0MB in the end (delta: 113.2MB). Free memory was 80.1MB in the beginning and 159.2MB in the end (delta: -79.0MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. [2023-11-06 22:24:02,802 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 123.7MB. Free memory is still 97.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:24:02,802 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.37ms. Allocated memory is still 123.7MB. Free memory was 80.1MB in the beginning and 68.5MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:24:02,803 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.56ms. Allocated memory is still 123.7MB. Free memory was 68.3MB in the beginning and 66.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:24:02,803 INFO L158 Benchmark]: Boogie Preprocessor took 39.02ms. Allocated memory is still 123.7MB. Free memory was 66.5MB in the beginning and 65.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:24:02,804 INFO L158 Benchmark]: RCFGBuilder took 391.85ms. Allocated memory was 123.7MB in the beginning and 163.6MB in the end (delta: 39.8MB). Free memory was 65.0MB in the beginning and 136.4MB in the end (delta: -71.4MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2023-11-06 22:24:02,805 INFO L158 Benchmark]: TraceAbstraction took 163479.34ms. Allocated memory was 163.6MB in the beginning and 237.0MB in the end (delta: 73.4MB). Free memory was 135.5MB in the beginning and 159.2MB in the end (delta: -23.7MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. [2023-11-06 22:24:02,807 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 123.7MB. Free memory is still 97.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 343.37ms. Allocated memory is still 123.7MB. Free memory was 80.1MB in the beginning and 68.5MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.56ms. Allocated memory is still 123.7MB. Free memory was 68.3MB in the beginning and 66.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.02ms. Allocated memory is still 123.7MB. Free memory was 66.5MB in the beginning and 65.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 391.85ms. Allocated memory was 123.7MB in the beginning and 163.6MB in the end (delta: 39.8MB). Free memory was 65.0MB in the beginning and 136.4MB in the end (delta: -71.4MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * TraceAbstraction took 163479.34ms. Allocated memory was 163.6MB in the beginning and 237.0MB in the end (delta: 73.4MB). Free memory was 135.5MB in the beginning and 159.2MB in the end (delta: -23.7MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/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_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_3_1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/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 613ee8845912b921567ac9e82f8c414d8758c61c69ed2c2ac2cbc303a1b4f001 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:24:05,286 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:24:05,432 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 22:24:05,441 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:24:05,442 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:24:05,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:24:05,488 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:24:05,489 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:24:05,490 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:24:05,495 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:24:05,496 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:24:05,497 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:24:05,497 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:24:05,499 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:24:05,500 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:24:05,500 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:24:05,501 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:24:05,501 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:24:05,502 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:24:05,502 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:24:05,503 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:24:05,503 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:24:05,504 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:24:05,504 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:24:05,505 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:24:05,505 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:24:05,505 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:24:05,506 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:24:05,506 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:24:05,507 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:24:05,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:24:05,509 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:24:05,509 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:24:05,510 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:24:05,510 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:24:05,510 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:24:05,511 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:24:05,511 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:24:05,511 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:24:05,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:24:05,513 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:24:05,513 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:24:05,514 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_48e59bb8-ab52-4ebf-aa15-8591ed169788/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_48e59bb8-ab52-4ebf-aa15-8591ed169788/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 -> 613ee8845912b921567ac9e82f8c414d8758c61c69ed2c2ac2cbc303a1b4f001 [2023-11-06 22:24:05,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:24:05,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:24:05,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:24:05,997 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:24:05,997 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:24:05,999 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/combinations/gcd_2+newton_3_1.i [2023-11-06 22:24:09,241 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:24:09,518 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:24:09,519 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/sv-benchmarks/c/combinations/gcd_2+newton_3_1.i [2023-11-06 22:24:09,533 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/data/6bc4cddcd/222f4db7344a426ab894acf27d3ff179/FLAG931e6f524 [2023-11-06 22:24:09,552 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/data/6bc4cddcd/222f4db7344a426ab894acf27d3ff179 [2023-11-06 22:24:09,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:24:09,559 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:24:09,563 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:24:09,563 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:24:09,569 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:24:09,569 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:24:09" (1/1) ... [2023-11-06 22:24:09,570 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71f2b3ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:09, skipping insertion in model container [2023-11-06 22:24:09,571 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:24:09" (1/1) ... [2023-11-06 22:24:09,604 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:24:09,764 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_48e59bb8-ab52-4ebf-aa15-8591ed169788/sv-benchmarks/c/combinations/gcd_2+newton_3_1.i[1226,1239] [2023-11-06 22:24:09,800 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_48e59bb8-ab52-4ebf-aa15-8591ed169788/sv-benchmarks/c/combinations/gcd_2+newton_3_1.i[2862,2875] [2023-11-06 22:24:09,801 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:24:09,816 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:24:09,849 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_48e59bb8-ab52-4ebf-aa15-8591ed169788/sv-benchmarks/c/combinations/gcd_2+newton_3_1.i[1226,1239] [2023-11-06 22:24:09,862 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_48e59bb8-ab52-4ebf-aa15-8591ed169788/sv-benchmarks/c/combinations/gcd_2+newton_3_1.i[2862,2875] [2023-11-06 22:24:09,863 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:24:09,885 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:24:09,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:09 WrapperNode [2023-11-06 22:24:09,886 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:24:09,888 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:24:09,888 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:24:09,889 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:24:09,897 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:24:09" (1/1) ... [2023-11-06 22:24:09,922 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:24:09" (1/1) ... [2023-11-06 22:24:09,958 INFO L138 Inliner]: procedures = 28, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 88 [2023-11-06 22:24:09,959 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:24:09,960 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:24:09,960 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:24:09,961 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:24:09,970 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:09" (1/1) ... [2023-11-06 22:24:09,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:09" (1/1) ... [2023-11-06 22:24:09,984 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:09" (1/1) ... [2023-11-06 22:24:09,985 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:09" (1/1) ... [2023-11-06 22:24:10,000 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:09" (1/1) ... [2023-11-06 22:24:10,009 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:09" (1/1) ... [2023-11-06 22:24:10,013 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:09" (1/1) ... [2023-11-06 22:24:10,026 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:09" (1/1) ... [2023-11-06 22:24:10,030 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:24:10,033 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:24:10,034 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:24:10,034 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:24:10,035 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:09" (1/1) ... [2023-11-06 22:24:10,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:24:10,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:24:10,078 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/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:24:10,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/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:24:10,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:24:10,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:24:10,126 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2023-11-06 22:24:10,127 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2023-11-06 22:24:10,127 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-11-06 22:24:10,127 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-11-06 22:24:10,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:24:10,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:24:10,251 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:24:10,253 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:24:21,444 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:24:21,451 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:24:21,451 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:24:21,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:24:21 BoogieIcfgContainer [2023-11-06 22:24:21,454 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:24:21,457 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:24:21,457 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:24:21,460 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:24:21,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:24:09" (1/3) ... [2023-11-06 22:24:21,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61716dc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:24:21, skipping insertion in model container [2023-11-06 22:24:21,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:09" (2/3) ... [2023-11-06 22:24:21,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61716dc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:24:21, skipping insertion in model container [2023-11-06 22:24:21,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:24:21" (3/3) ... [2023-11-06 22:24:21,464 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_3_1.i [2023-11-06 22:24:21,484 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:24:21,484 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-06 22:24:21,555 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:24:21,563 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;@18345ca0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:24:21,563 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-06 22:24:21,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 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-06 22:24:21,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-06 22:24:21,577 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:21,578 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:21,579 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:21,586 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:21,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2023-11-06 22:24:21,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:24:21,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [888155723] [2023-11-06 22:24:21,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:21,600 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:24:21,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:24:21,610 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:24:21,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 22:24:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:21,735 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:24:21,739 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:24:21,945 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:24:21,946 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:24:21,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:24:21,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [888155723] [2023-11-06 22:24:21,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [888155723] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:21,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:21,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:24:21,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582153933] [2023-11-06 22:24:21,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:21,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:24:21,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:24:22,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:24:22,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:24:22,005 INFO L87 Difference]: Start difference. First operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:24:22,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:22,144 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2023-11-06 22:24:22,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:24:22,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:24:22,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:22,159 INFO L225 Difference]: With dead ends: 74 [2023-11-06 22:24:22,159 INFO L226 Difference]: Without dead ends: 33 [2023-11-06 22:24:22,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:24:22,168 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:22,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:24:22,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-06 22:24:22,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-11-06 22:24:22,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 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-06 22:24:22,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2023-11-06 22:24:22,227 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 11 [2023-11-06 22:24:22,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:22,228 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2023-11-06 22:24:22,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:24:22,229 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2023-11-06 22:24:22,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-06 22:24:22,231 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:22,231 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:22,250 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:24:22,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:24:22,445 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:22,446 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:22,446 INFO L85 PathProgramCache]: Analyzing trace with hash 65622039, now seen corresponding path program 1 times [2023-11-06 22:24:22,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:24:22,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [377105330] [2023-11-06 22:24:22,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:22,447 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:24:22,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:24:22,449 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:24:22,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-06 22:24:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:22,532 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:24:22,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:24:22,704 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:24:22,704 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:24:22,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:24:22,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [377105330] [2023-11-06 22:24:22,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [377105330] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:22,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:22,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:24:22,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408002926] [2023-11-06 22:24:22,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:22,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:24:22,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:24:22,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:24:22,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:24:22,710 INFO L87 Difference]: Start difference. First operand 33 states and 39 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:24:22,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:22,930 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2023-11-06 22:24:22,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:24:22,931 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:24:22,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:22,932 INFO L225 Difference]: With dead ends: 40 [2023-11-06 22:24:22,932 INFO L226 Difference]: Without dead ends: 34 [2023-11-06 22:24:22,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:24:22,935 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 3 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:22,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 98 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:24:22,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-06 22:24:22,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2023-11-06 22:24:22,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 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-06 22:24:22,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2023-11-06 22:24:22,944 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 11 [2023-11-06 22:24:22,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:22,945 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2023-11-06 22:24:22,945 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:24:22,945 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2023-11-06 22:24:22,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-06 22:24:22,946 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:22,947 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:22,964 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:24:23,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:24:23,160 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:23,160 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:23,160 INFO L85 PathProgramCache]: Analyzing trace with hash 149955676, now seen corresponding path program 1 times [2023-11-06 22:24:23,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:24:23,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033824671] [2023-11-06 22:24:23,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:23,161 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:24:23,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:24:23,163 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:24:23,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-06 22:24:23,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,259 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:24:23,260 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:24:23,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:24:23,415 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:24:23,416 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:24:23,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2033824671] [2023-11-06 22:24:23,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2033824671] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:23,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:23,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:24:23,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875890121] [2023-11-06 22:24:23,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:23,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:24:23,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:24:23,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:24:23,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:24:23,420 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-06 22:24:23,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:23,539 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2023-11-06 22:24:23,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:24:23,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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 12 [2023-11-06 22:24:23,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:23,542 INFO L225 Difference]: With dead ends: 41 [2023-11-06 22:24:23,542 INFO L226 Difference]: Without dead ends: 33 [2023-11-06 22:24:23,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:24:23,544 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:23,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 98 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:24:23,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-06 22:24:23,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-11-06 22:24:23,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 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-06 22:24:23,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2023-11-06 22:24:23,552 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 12 [2023-11-06 22:24:23,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:23,553 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2023-11-06 22:24:23,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-06 22:24:23,553 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2023-11-06 22:24:23,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-06 22:24:23,554 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:23,554 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:23,571 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:24:23,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:24:23,765 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:23,766 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:23,766 INFO L85 PathProgramCache]: Analyzing trace with hash -659390950, now seen corresponding path program 1 times [2023-11-06 22:24:23,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:24:23,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [606300545] [2023-11-06 22:24:23,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:23,767 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:24:23,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:24:23,768 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:24:23,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-06 22:24:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,850 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 22:24:23,852 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:24:24,443 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:24:24,444 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:24:25,267 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:24:25,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:24:25,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [606300545] [2023-11-06 22:24:25,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [606300545] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:24:25,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:24:25,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-06 22:24:25,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303045183] [2023-11-06 22:24:25,269 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:24:25,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 22:24:25,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:24:25,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 22:24:25,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:24:25,272 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:27,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:27,401 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2023-11-06 22:24:27,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:24:27,402 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-06 22:24:27,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:27,403 INFO L225 Difference]: With dead ends: 48 [2023-11-06 22:24:27,403 INFO L226 Difference]: Without dead ends: 36 [2023-11-06 22:24:27,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2023-11-06 22:24:27,406 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 18 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:27,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 264 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-06 22:24:27,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-06 22:24:27,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-11-06 22:24:27,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 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-06 22:24:27,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2023-11-06 22:24:27,416 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 12 [2023-11-06 22:24:27,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:27,416 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2023-11-06 22:24:27,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:27,417 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2023-11-06 22:24:27,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-06 22:24:27,418 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:27,418 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:27,434 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-06 22:24:27,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:24:27,631 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:27,632 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:27,632 INFO L85 PathProgramCache]: Analyzing trace with hash -2084161321, now seen corresponding path program 2 times [2023-11-06 22:24:27,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:24:27,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [196564281] [2023-11-06 22:24:27,632 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:24:27,633 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:24:27,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:24:27,634 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:24:27,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e59bb8-ab52-4ebf-aa15-8591ed169788/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-06 22:24:34,829 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:24:34,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:24:34,851 WARN L260 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-06 22:24:34,854 INFO L285 TraceCheckSpWp]: Computing forward predicates...