./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_2+newton_2_3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_2_3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f6c5808fcdfedd93e514ea4bc51242b78bf5dcc9e332c7faf3dfcc4d6de127e2 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:59:36,594 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:59:36,691 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 15:59:36,696 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:59:36,696 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:59:36,718 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:59:36,718 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:59:36,719 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:59:36,719 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:59:36,719 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:59:36,719 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:59:36,720 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:59:36,720 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:59:36,720 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:59:36,720 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:59:36,720 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:59:36,721 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:59:36,721 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:59:36,721 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:59:36,721 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:59:36,721 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:59:36,721 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:59:36,722 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:59:36,722 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:59:36,722 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:59:36,722 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:59:36,722 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:59:36,722 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:59:36,723 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:59:36,723 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:59:36,723 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:59:36,723 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:59:36,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:59:36,723 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:59:36,723 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:59:36,724 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:59:36,724 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 15:59:36,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 15:59:36,724 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:59:36,724 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:59:36,724 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:59:36,724 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:59:36,724 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f6c5808fcdfedd93e514ea4bc51242b78bf5dcc9e332c7faf3dfcc4d6de127e2 [2024-11-13 15:59:37,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:59:37,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:59:37,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:59:37,070 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:59:37,071 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:59:37,073 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/combinations/gcd_2+newton_2_3.i Unable to find full path for "g++" [2024-11-13 15:59:38,928 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:59:39,265 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:59:39,265 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/sv-benchmarks/c/combinations/gcd_2+newton_2_3.i [2024-11-13 15:59:39,274 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/data/c1e52a33b/3a8a5ecdb2aa4d3486b87a75140e08d1/FLAGc54837a2c [2024-11-13 15:59:39,524 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/data/c1e52a33b/3a8a5ecdb2aa4d3486b87a75140e08d1 [2024-11-13 15:59:39,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:59:39,537 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:59:39,539 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:59:39,539 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:59:39,548 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:59:39,553 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:59:39" (1/1) ... [2024-11-13 15:59:39,556 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a6e1601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:59:39, skipping insertion in model container [2024-11-13 15:59:39,557 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:59:39" (1/1) ... [2024-11-13 15:59:39,591 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:59:39,778 WARN L250 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_64499b9c-721d-43d0-9709-eb9f21574abf/sv-benchmarks/c/combinations/gcd_2+newton_2_3.i[1226,1239] [2024-11-13 15:59:39,809 WARN L250 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_64499b9c-721d-43d0-9709-eb9f21574abf/sv-benchmarks/c/combinations/gcd_2+newton_2_3.i[2841,2854] [2024-11-13 15:59:39,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:59:39,821 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:59:39,840 WARN L250 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_64499b9c-721d-43d0-9709-eb9f21574abf/sv-benchmarks/c/combinations/gcd_2+newton_2_3.i[1226,1239] [2024-11-13 15:59:39,866 WARN L250 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_64499b9c-721d-43d0-9709-eb9f21574abf/sv-benchmarks/c/combinations/gcd_2+newton_2_3.i[2841,2854] [2024-11-13 15:59:39,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:59:39,890 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:59:39,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:59:39 WrapperNode [2024-11-13 15:59:39,891 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:59:39,893 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:59:39,894 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:59:39,894 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:59:39,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:59:39" (1/1) ... [2024-11-13 15:59:39,911 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:59:39" (1/1) ... [2024-11-13 15:59:39,939 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 85 [2024-11-13 15:59:39,942 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:59:39,943 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:59:39,944 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:59:39,944 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:59:39,954 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:59:39" (1/1) ... [2024-11-13 15:59:39,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:59:39" (1/1) ... [2024-11-13 15:59:39,956 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:59:39" (1/1) ... [2024-11-13 15:59:39,981 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-13 15:59:39,982 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:59:39" (1/1) ... [2024-11-13 15:59:39,982 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:59:39" (1/1) ... [2024-11-13 15:59:39,987 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:59:39" (1/1) ... [2024-11-13 15:59:39,994 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:59:39" (1/1) ... [2024-11-13 15:59:39,998 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:59:39" (1/1) ... [2024-11-13 15:59:40,003 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:59:39" (1/1) ... [2024-11-13 15:59:40,005 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:59:40,009 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:59:40,009 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:59:40,009 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:59:40,010 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:59:39" (1/1) ... [2024-11-13 15:59:40,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:59:40,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:59:40,049 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:59:40,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:59:40,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:59:40,080 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-13 15:59:40,080 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-13 15:59:40,080 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-13 15:59:40,081 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-13 15:59:40,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 15:59:40,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 15:59:40,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:59:40,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:59:40,153 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:59:40,155 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:59:40,419 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-13 15:59:40,419 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:59:40,428 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:59:40,429 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 15:59:40,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:59:40 BoogieIcfgContainer [2024-11-13 15:59:40,429 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:59:40,432 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:59:40,432 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:59:40,437 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:59:40,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:59:39" (1/3) ... [2024-11-13 15:59:40,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0f1819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:59:40, skipping insertion in model container [2024-11-13 15:59:40,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:59:39" (2/3) ... [2024-11-13 15:59:40,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0f1819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:59:40, skipping insertion in model container [2024-11-13 15:59:40,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:59:40" (3/3) ... [2024-11-13 15:59:40,440 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_3.i [2024-11-13 15:59:40,456 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:59:40,457 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG gcd_2+newton_2_3.i that has 3 procedures, 37 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2024-11-13 15:59:40,511 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:59:40,529 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1482874d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:59:40,529 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 15:59:40,534 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 15:59:40,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 15:59:40,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:59:40,542 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:59:40,543 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:59:40,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:59:40,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1738968779, now seen corresponding path program 1 times [2024-11-13 15:59:40,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:59:40,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411482871] [2024-11-13 15:59:40,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:59:40,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:59:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:59:40,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:59:40,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:59:40,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411482871] [2024-11-13 15:59:40,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411482871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:59:40,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:59:40,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:59:40,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574332624] [2024-11-13 15:59:40,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:59:40,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:59:40,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:59:40,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:59:40,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:59:40,891 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:59:40,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:59:40,968 INFO L93 Difference]: Finished difference Result 72 states and 91 transitions. [2024-11-13 15:59:40,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:59:40,970 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 [2024-11-13 15:59:40,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:59:40,977 INFO L225 Difference]: With dead ends: 72 [2024-11-13 15:59:40,977 INFO L226 Difference]: Without dead ends: 30 [2024-11-13 15:59:40,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:59:40,983 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:59:40,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 107 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:59:40,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-13 15:59:41,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2024-11-13 15:59:41,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 15:59:41,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2024-11-13 15:59:41,020 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 11 [2024-11-13 15:59:41,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:59:41,020 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2024-11-13 15:59:41,021 INFO L472 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) [2024-11-13 15:59:41,021 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2024-11-13 15:59:41,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 15:59:41,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:59:41,022 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:59:41,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 15:59:41,023 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:59:41,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:59:41,024 INFO L85 PathProgramCache]: Analyzing trace with hash 36038583, now seen corresponding path program 1 times [2024-11-13 15:59:41,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:59:41,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906061003] [2024-11-13 15:59:41,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:59:41,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:59:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:59:41,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:59:41,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:59:41,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906061003] [2024-11-13 15:59:41,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906061003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:59:41,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:59:41,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:59:41,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733954304] [2024-11-13 15:59:41,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:59:41,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:59:41,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:59:41,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:59:41,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:59:41,162 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:59:41,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:59:41,187 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2024-11-13 15:59:41,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:59:41,188 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 [2024-11-13 15:59:41,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:59:41,188 INFO L225 Difference]: With dead ends: 36 [2024-11-13 15:59:41,189 INFO L226 Difference]: Without dead ends: 30 [2024-11-13 15:59:41,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:59:41,190 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:59:41,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 81 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:59:41,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-13 15:59:41,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-13 15:59:41,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 15:59:41,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-11-13 15:59:41,198 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2024-11-13 15:59:41,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:59:41,198 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-11-13 15:59:41,199 INFO L472 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) [2024-11-13 15:59:41,199 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-11-13 15:59:41,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 15:59:41,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:59:41,199 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:59:41,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 15:59:41,200 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:59:41,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:59:41,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1576478087, now seen corresponding path program 1 times [2024-11-13 15:59:41,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:59:41,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866081975] [2024-11-13 15:59:41,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:59:41,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:59:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:59:41,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:59:41,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:59:41,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866081975] [2024-11-13 15:59:41,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866081975] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:59:41,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468533303] [2024-11-13 15:59:41,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:59:41,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:59:41,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:59:41,473 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:59:41,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 15:59:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:59:41,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 15:59:41,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:59:41,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:59:41,755 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:59:41,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:59:41,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468533303] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:59:41,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:59:41,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-13 15:59:41,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297475733] [2024-11-13 15:59:41,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:59:41,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:59:41,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:59:41,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:59:41,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:59:41,884 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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) [2024-11-13 15:59:42,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:59:42,030 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2024-11-13 15:59:42,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:59:42,031 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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 [2024-11-13 15:59:42,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:59:42,031 INFO L225 Difference]: With dead ends: 37 [2024-11-13 15:59:42,032 INFO L226 Difference]: Without dead ends: 31 [2024-11-13 15:59:42,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:59:42,033 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:59:42,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 176 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:59:42,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-13 15:59:42,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-13 15:59:42,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 15:59:42,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2024-11-13 15:59:42,038 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 12 [2024-11-13 15:59:42,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:59:42,038 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-11-13 15:59:42,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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) [2024-11-13 15:59:42,038 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2024-11-13 15:59:42,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 15:59:42,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:59:42,039 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:59:42,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-13 15:59:42,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:59:42,242 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:59:42,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:59:42,243 INFO L85 PathProgramCache]: Analyzing trace with hash -24887305, now seen corresponding path program 2 times [2024-11-13 15:59:42,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:59:42,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99657407] [2024-11-13 15:59:42,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:59:42,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:59:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:59:42,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:59:42,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:59:42,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99657407] [2024-11-13 15:59:42,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99657407] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:59:42,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552661117] [2024-11-13 15:59:42,779 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 15:59:42,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:59:42,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:59:42,781 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:59:42,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 15:59:42,874 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 15:59:42,874 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:59:42,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-13 15:59:42,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:00:25,742 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (let ((.cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_main1_~y~0#1|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_15| 1) 0) (= (mod (+ (* |c_ULTIMATE.start_main1_~y~0#1| 255) .cse0) 256) (+ 256 |c_ULTIMATE.start_gcd_test_#res#1|)) (not (= .cse0 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_main1_~y~0#1|) |c_ULTIMATE.start_gcd_test_#res#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_15|)))) (not (= 0 |c_ULTIMATE.start_gcd_test_#res#1|)) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (let ((.cse1 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (and (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_16|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_16| |c_ULTIMATE.start_gcd_test_#res#1|) 0))))) (or (and .cse1 (<= (+ 1 |c_ULTIMATE.start_gcd_test_#res#1|) 0)) (and .cse1 (<= 0 |c_ULTIMATE.start_gcd_test_#res#1|))))) is different from true [2024-11-13 16:00:46,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:00:46,148 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:01:30,156 WARN L286 SmtUtils]: Spent 7.42s on a formula simplification that was a NOOP. DAG size: 106 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 16:01:47,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:01:47,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552661117] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:01:47,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:01:47,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 24 [2024-11-13 16:01:47,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100987409] [2024-11-13 16:01:47,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:01:47,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-13 16:01:47,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:01:47,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-13 16:01:47,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=405, Unknown=14, NotChecked=42, Total=552 [2024-11-13 16:01:47,789 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 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) [2024-11-13 16:01:52,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 16:01:57,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 16:02:01,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 16:02:05,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 16:02:07,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2024-11-13 16:02:11,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 16:02:16,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 16:02:20,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 16:02:27,585 WARN L286 SmtUtils]: Spent 6.60s on a formula simplification. DAG size of input: 111 DAG size of output: 177 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 16:02:33,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 16:02:37,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 16:02:41,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2024-11-13 16:02:43,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:02:43,557 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2024-11-13 16:02:43,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 16:02:43,557 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 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 [2024-11-13 16:02:43,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:02:43,558 INFO L225 Difference]: With dead ends: 47 [2024-11-13 16:02:43,558 INFO L226 Difference]: Without dead ends: 35 [2024-11-13 16:02:43,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 98.9s TimeCoverageRelationStatistics Valid=123, Invalid=567, Unknown=16, NotChecked=50, Total=756 [2024-11-13 16:02:43,560 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 5 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 46.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:02:43,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 343 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 116 Invalid, 10 Unknown, 50 Unchecked, 46.1s Time] [2024-11-13 16:02:43,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-13 16:02:43,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-13 16:02:43,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 16:02:43,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-11-13 16:02:43,571 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 13 [2024-11-13 16:02:43,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:02:43,572 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-13 16:02:43,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 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) [2024-11-13 16:02:43,572 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-11-13 16:02:43,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 16:02:43,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:02:43,573 INFO L215 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:02:43,588 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 16:02:43,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:02:43,775 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:02:43,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:02:43,776 INFO L85 PathProgramCache]: Analyzing trace with hash -710557577, now seen corresponding path program 3 times [2024-11-13 16:02:43,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:02:43,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691957078] [2024-11-13 16:02:43,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:02:43,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:02:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:51,482 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:02:51,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:02:51,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691957078] [2024-11-13 16:02:51,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691957078] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:02:51,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702958079] [2024-11-13 16:02:51,483 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 16:02:51,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:02:51,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:02:51,485 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:02:51,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 16:02:51,699 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-13 16:02:51,699 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:02:51,702 WARN L253 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-13 16:02:51,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:03:36,701 WARN L286 SmtUtils]: Spent 10.44s on a formula simplification. DAG size of input: 168 DAG size of output: 166 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 16:04:08,163 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (let ((.cse15 (* |c_ULTIMATE.start_gcd_test_~a#1| 255)) (.cse16 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256))) (let ((.cse10 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse9 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) (.cse37 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse69 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_25| 1) 0) (not (= .cse69 0)) (= (mod (+ .cse15 .cse69) 256) .cse16)))))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse2 (mod .cse1 256))) (let ((.cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse2))) (and (<= (mod (+ .cse0 .cse1) 256) 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_25|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_gcd_test_~a#1|)) (<= |v_ULTIMATE.start_gcd_test_~a#1_25| .cse2))) (<= .cse2 127) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse0) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse2 0))))))) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse4 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse5 (mod .cse4 256))) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse5))) (and (<= 128 (mod (+ .cse3 .cse4) 256)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_25|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_gcd_test_~a#1|)) (<= |v_ULTIMATE.start_gcd_test_~a#1_25| .cse5))) (<= .cse5 127) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse3) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= (mod .cse3 256) 127)))))) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse8 (mod (+ .cse9 .cse6) 256))) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| (+ (- 256) .cse8)))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= 128 (mod (+ (* 255 .cse6) |c_ULTIMATE.start_main1_~y~0#1| .cse7) 256)) (not (= .cse6 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse7) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 .cse8) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_25|) .cse8) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_gcd_test_~a#1|) 0)))))) .cse10) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse13 (mod (+ .cse9 .cse11) 256))) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| (+ (- 256) .cse13)))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (not (= .cse11 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse12) (<= 128 .cse13) (<= (mod (+ (* 255 .cse11) |c_ULTIMATE.start_main1_~y~0#1| .cse12) 256) 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_25|) .cse13) (not (= .cse14 0)) (= (mod (+ .cse15 .cse14) 256) .cse16))))))))) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse17 (mod .cse19 256))) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| (+ (- 256) .cse17)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_25|) .cse17) (not (= .cse18 0)) (= (mod (+ .cse15 .cse18) 256) .cse16)))) (<= (mod (+ (* 255 .cse19) .cse20) 256) 127) (<= 128 .cse17) (= .cse20 |c_ULTIMATE.start_gcd_test_~a#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|)))))) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse23 (mod .cse22 256))) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse23))) (and (<= 128 (mod (+ .cse21 .cse22) 256)) (<= .cse23 127) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse21) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= (mod .cse21 256) 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= |v_ULTIMATE.start_gcd_test_~a#1_25| .cse23) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_gcd_test_~a#1|) 0)))))) .cse10) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse24 (mod (+ .cse9 .cse26) 256))) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse24))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= |v_ULTIMATE.start_gcd_test_~a#1_25| .cse24) (<= 128 (mod (+ .cse9 .cse25 .cse26) 256)) (not (= .cse26 0)) (<= (mod .cse25 256) 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= .cse24 127) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse25) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_gcd_test_~a#1|) 0)))))) .cse10) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse29 (mod (+ .cse9 .cse28) 256))) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse29))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= 128 (mod (+ .cse9 .cse27 .cse28) 256)) (not (= .cse28 0)) (<= (mod .cse27 256) 127) (<= .cse29 127) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse27) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_25|) (<= |v_ULTIMATE.start_gcd_test_~a#1_25| .cse29) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_gcd_test_~a#1|))))))))) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse32 (mod .cse30 256))) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| (+ (- 256) .cse32)))) (and (<= (mod (+ (* 255 .cse30) .cse31) 256) 127) (<= 128 .cse32) (= .cse31 |c_ULTIMATE.start_gcd_test_~a#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_25|) .cse32) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_gcd_test_~a#1|) 0)))))) .cse10) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse33 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse35 (mod (+ .cse9 .cse33) 256))) (let ((.cse34 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| (+ (- 256) .cse35)))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= 128 (mod (+ (* 255 .cse33) |c_ULTIMATE.start_main1_~y~0#1| .cse34) 256)) (not (= .cse33 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse34) (<= 128 .cse35) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_25|) .cse35) (not (= .cse36 0)) (= (mod (+ .cse15 .cse36) 256) .cse16))))))))) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|))) (and .cse37 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse39 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse40 (mod .cse39 256))) (let ((.cse38 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse40))) (and (<= (mod (+ .cse38 .cse39) 256) 127) (<= .cse40 127) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse38) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse40 0)))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse42 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse43 (mod .cse42 256))) (let ((.cse41 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse43))) (and (<= (mod (+ .cse41 .cse42) 256) 127) (<= .cse43 127) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse41) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= |v_ULTIMATE.start_gcd_test_~a#1_25| .cse43) (not (= .cse43 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_gcd_test_~a#1|) 0)))))) .cse10) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse44 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse46 (mod .cse44 256))) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| (+ (- 256) .cse46)))) (and (<= 128 (mod (+ (* 255 .cse44) .cse45) 256)) (<= 128 .cse46) (= .cse45 |c_ULTIMATE.start_gcd_test_~a#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_25|) .cse46) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_gcd_test_~a#1|) 0)))))) .cse10) (and .cse37 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse48 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse49 (mod .cse48 256))) (let ((.cse47 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse49))) (and (<= 128 (mod (+ .cse47 .cse48) 256)) (<= .cse49 127) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse47) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= (mod .cse47 256) 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (and (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse51 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse52 (mod (+ .cse9 .cse51) 256))) (let ((.cse50 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse52))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= (mod (+ .cse9 .cse50 .cse51) 256) 127) (not (= .cse52 0)) (not (= .cse51 0)) (<= .cse52 127) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse50) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_25|) (<= |v_ULTIMATE.start_gcd_test_~a#1_25| .cse52) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_gcd_test_~a#1|))))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse55 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse53 (mod .cse55 256))) (let ((.cse56 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| (+ (- 256) .cse53)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse54 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_25|) .cse53) (not (= .cse54 0)) (= (mod (+ .cse15 .cse54) 256) .cse16)))) (<= 128 (mod (+ (* 255 .cse55) .cse56) 256)) (<= 128 .cse53) (= .cse56 |c_ULTIMATE.start_gcd_test_~a#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|)))))) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse57 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse59 (mod (+ .cse9 .cse57) 256))) (let ((.cse58 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| (+ (- 256) .cse59)))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (not (= .cse57 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse58) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 .cse59) (<= (mod (+ (* 255 .cse57) |c_ULTIMATE.start_main1_~y~0#1| .cse58) 256) 127) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_25|) .cse59) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_gcd_test_~a#1|) 0)))))) .cse10) (and .cse37 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse61 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse62 (mod (+ .cse9 .cse61) 256))) (let ((.cse60 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse62))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= 128 (mod (+ .cse9 .cse60 .cse61) 256)) (not (= .cse61 0)) (<= (mod .cse60 256) 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= .cse62 127) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse60))))))) (and .cse10 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse64 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse65 (mod (+ .cse9 .cse64) 256))) (let ((.cse63 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse65))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= (mod (+ .cse9 .cse63 .cse64) 256) 127) (not (= .cse65 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_25| .cse65) (not (= .cse64 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= .cse65 127) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse63) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_gcd_test_~a#1|) 0))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse67 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse68 (mod (+ .cse9 .cse67) 256))) (let ((.cse66 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse68))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= (mod (+ .cse9 .cse66 .cse67) 256) 127) (not (= .cse68 0)) (not (= .cse67 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= .cse68 127) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse66)))))) .cse37)))) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2024-11-13 16:05:18,364 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (let ((.cse98 (mod |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse97 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (let ((.cse5 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) (.cse42 (<= 128 .cse97)) (.cse43 (<= .cse98 127)) (.cse38 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse0 (<= 128 .cse98)) (.cse1 (<= .cse97 127)) (.cse8 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse2 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse13 (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| 1) 0))) (or (and (or (and .cse0 .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse7 (mod (+ .cse5 .cse6) 256))) (let ((.cse4 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse7))) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (= .cse2 (mod (+ .cse3 (* 255 .cse4)) 256)) (<= (mod (+ .cse5 .cse4 .cse6) 256) 127) (= (mod .cse4 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse7 0)) (not (= .cse6 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= .cse7 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_25| 1) 0) (not (= .cse4 0)) (not (= .cse3 0)))))))) .cse8) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse12 (mod (+ .cse5 .cse11) 256))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse12))) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse10))) (and (= .cse2 (mod (+ .cse9 (* 255 .cse10)) 256)) (<= (mod (+ .cse5 .cse10 .cse11) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse10 |c_ULTIMATE.start_gcd_test_~a#1|)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse10 0)) (not (= .cse9 0)))))) (not (= .cse12 0)) (not (= .cse11 0)) (<= .cse12 127))))) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_25| 1) 0)))) .cse13) (and (or (and .cse0 .cse1 .cse8 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse17 (mod .cse16 256))) (let ((.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse17))) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse15))) (and (not (= .cse14 0)) (= (mod .cse15 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= 128 (mod (+ .cse15 .cse16) 256)) (<= .cse17 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (= .cse2 (mod (+ .cse14 (* 255 .cse15)) 256)) (<= (mod .cse15 256) 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_25| 1) 0)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_25| 1) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse21 (mod .cse20 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse21))) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse19))) (and (not (= .cse18 0)) (<= 128 (mod (+ .cse19 .cse20) 256)) (= .cse2 (mod (+ .cse18 (* 255 .cse19)) 256)) (<= (mod .cse19 256) 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse19 |c_ULTIMATE.start_gcd_test_~a#1|)))))) (<= .cse21 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|)))))))) .cse13) (and (or (and .cse0 .cse1 .cse8 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse25 (mod .cse24 256))) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| (+ (- 256) .cse25)))) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse22))) (and (= (mod (+ (* .cse22 255) .cse23) 256) .cse2) (not (= .cse23 0)) (<= (mod (+ (* 255 .cse24) .cse22) 256) 127) (<= 128 .cse25) (not (= .cse22 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (= (mod .cse22 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_25|) .cse25)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse29 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse26 (mod .cse29 256))) (and (<= 128 .cse26) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (and (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_25|) .cse26) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| (+ (- 256) .cse26)))) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse27))) (and (= (mod (+ (* .cse27 255) .cse28) 256) .cse2) (not (= .cse28 0)) (<= (mod (+ (* 255 .cse29) .cse27) 256) 127) (not (= .cse27 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse27 |c_ULTIMATE.start_gcd_test_~a#1|)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|)))))))))))) .cse13) (and (or (and .cse0 .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse33 (mod .cse31 256))) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse33))) (let ((.cse32 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse30))) (and (<= (mod (+ .cse30 .cse31) 256) 127) (not (= .cse32 0)) (= (mod .cse30 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= .cse33 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (= .cse2 (mod (+ .cse32 (* 255 .cse30)) 256)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_25| 1) 0) (not (= .cse30 0)) (not (= .cse33 0)))))))) .cse8) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_25| 1) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse34 (mod .cse36 256))) (and (<= .cse34 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse34 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse34))) (let ((.cse37 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse35))) (and (<= (mod (+ .cse35 .cse36) 256) 127) (not (= .cse37 0)) (= .cse2 (mod (+ .cse37 (* 255 .cse35)) 256)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse35 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse35 |c_ULTIMATE.start_gcd_test_~a#1|))))))))))))) .cse13) (and .cse38 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse41 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse40 (mod (+ .cse5 .cse41) 256))) (let ((.cse39 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse40))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse39) |c_ULTIMATE.start_gcd_test_~a#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_25|) (= (mod .cse39 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= |v_ULTIMATE.start_gcd_test_~a#1_25| .cse40) (<= 128 (mod (+ .cse5 .cse39 .cse41) 256)) (not (= .cse41 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= .cse40 127)))))) .cse8 .cse42 .cse43) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_25|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse46 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse44 (mod (+ .cse5 .cse46) 256))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= |v_ULTIMATE.start_gcd_test_~a#1_25| .cse44) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse44))) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse45) |c_ULTIMATE.start_gcd_test_~a#1|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse45 |c_ULTIMATE.start_gcd_test_~a#1|)) (<= 128 (mod (+ .cse5 .cse45 .cse46) 256)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|)))) (not (= .cse46 0)) (<= .cse44 127))))))))) (and .cse13 (or (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse47 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse50 (mod (+ .cse5 .cse47) 256))) (let ((.cse48 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| (+ (- 256) .cse50)))) (let ((.cse49 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse48))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= 128 (mod (+ (* 255 .cse47) |c_ULTIMATE.start_main1_~y~0#1| .cse48) 256)) (not (= .cse47 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse49 0)) (<= 128 .cse50) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_25|) .cse50) (= .cse2 (mod (+ .cse49 (* 255 .cse48)) 256)) (not (= .cse48 0)) (= (mod .cse48 |c_ULTIMATE.start_gcd_test_~a#1|) 0))))))) .cse1 .cse8) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse51 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse54 (mod (+ .cse5 .cse51) 256))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (not (= .cse51 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse52 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| (+ (- 256) .cse54)))) (let ((.cse53 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse52))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse52 |c_ULTIMATE.start_gcd_test_~a#1|)) (<= 128 (mod (+ (* 255 .cse51) |c_ULTIMATE.start_main1_~y~0#1| .cse52) 256)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse53 0)) (= .cse2 (mod (+ .cse53 (* 255 .cse52)) 256)) (not (= .cse52 0)))))) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_25|) .cse54))) (<= 128 .cse54))))))) (and .cse13 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse57 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse58 (mod (+ .cse5 .cse57) 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse56 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse58))) (let ((.cse55 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse56))) (and (= .cse2 (mod (+ .cse55 (* 255 .cse56)) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse56 |c_ULTIMATE.start_gcd_test_~a#1|)) (<= 128 (mod (+ .cse5 .cse56 .cse57) 256)) (<= (mod .cse56 256) 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse55 0)))))) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (not (= .cse57 0)) (<= .cse58 127))))) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_25| 1) 0))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse61 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse62 (mod (+ .cse5 .cse61) 256))) (let ((.cse60 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse62))) (let ((.cse59 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse60))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (= .cse2 (mod (+ .cse59 (* 255 .cse60)) 256)) (= (mod .cse60 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= 128 (mod (+ .cse5 .cse60 .cse61) 256)) (not (= .cse61 0)) (<= (mod .cse60 256) 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= .cse62 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_25| 1) 0) (not (= .cse59 0)))))))) .cse0 .cse1 .cse8))) (and .cse38 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_25|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse64 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse63 (mod (+ .cse5 .cse64) 256))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (not (= .cse63 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_25| .cse63) (not (= .cse64 0)) (<= .cse63 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse65 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse63))) (and (<= (mod (+ .cse5 .cse65 .cse64) 256) 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse65) |c_ULTIMATE.start_gcd_test_~a#1|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse65 |c_ULTIMATE.start_gcd_test_~a#1|)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse65 0))))))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse67 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse68 (mod (+ .cse5 .cse67) 256))) (let ((.cse66 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse68))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= (mod (+ .cse5 .cse66 .cse67) 256) 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse66) |c_ULTIMATE.start_gcd_test_~a#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_25|) (= (mod .cse66 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= |v_ULTIMATE.start_gcd_test_~a#1_25| .cse68) (not (= .cse67 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= .cse68 127) (not (= .cse66 0))))))) .cse8 .cse42 .cse43))) (and .cse38 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse70 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse71 (mod .cse70 256))) (let ((.cse69 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse71))) (and (<= (mod (+ .cse69 .cse70) 256) 127) (= (mod .cse69 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_25|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse69)) (<= .cse71 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= |v_ULTIMATE.start_gcd_test_~a#1_25| .cse71) (not (= .cse69 0))))))) .cse8 .cse42 .cse43) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_25|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse73 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse74 (mod .cse73 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse72 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse74))) (and (<= (mod (+ .cse72 .cse73) 256) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse72)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse72 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse72 |c_ULTIMATE.start_gcd_test_~a#1|))))) (<= .cse74 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= |v_ULTIMATE.start_gcd_test_~a#1_25| .cse74) (not (= .cse74 0)))))))))) (and (or (and .cse0 .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse75 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse77 (mod (+ .cse5 .cse75) 256))) (let ((.cse78 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| (+ (- 256) .cse77)))) (let ((.cse76 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse78))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (not (= .cse75 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse76 0)) (<= 128 .cse77) (<= (mod (+ (* 255 .cse75) |c_ULTIMATE.start_main1_~y~0#1| .cse78) 256) 127) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_25|) .cse77) (= .cse2 (mod (+ .cse76 (* 255 .cse78)) 256)) (not (= .cse78 0)) (= (mod .cse78 |c_ULTIMATE.start_gcd_test_~a#1|) 0))))))) .cse8) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse79 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse80 (mod (+ .cse5 .cse79) 256))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (not (= .cse79 0)) (<= 128 .cse80) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (and (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_25|) .cse80) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse81 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| (+ (- 256) .cse80)))) (let ((.cse82 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse81))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse81 |c_ULTIMATE.start_gcd_test_~a#1|)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse82 0)) (<= (mod (+ (* 255 .cse79) |c_ULTIMATE.start_main1_~y~0#1| .cse81) 256) 127) (= .cse2 (mod (+ .cse82 (* 255 .cse81)) 256)) (not (= .cse81 0))))))))))))) .cse13) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_25|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse85 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse83 (mod .cse85 256))) (and (<= .cse83 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse84 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse83))) (and (<= 128 (mod (+ .cse84 .cse85) 256)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse84)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse84 |c_ULTIMATE.start_gcd_test_~a#1|))))) (<= |v_ULTIMATE.start_gcd_test_~a#1_25| .cse83))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse87 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse88 (mod .cse87 256))) (let ((.cse86 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse88))) (and (= (mod .cse86 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_25|) (<= 128 (mod (+ .cse86 .cse87) 256)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse86)) (<= .cse88 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= |v_ULTIMATE.start_gcd_test_~a#1_25| .cse88)))))) .cse8 .cse42 .cse43)) .cse38) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse92 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse89 (mod .cse92 256))) (and (<= 128 .cse89) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse90 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| (+ (- 256) .cse89)))) (let ((.cse91 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse90))) (and (= (mod (+ (* .cse90 255) .cse91) 256) .cse2) (not (= .cse91 0)) (<= 128 (mod (+ (* 255 .cse92) .cse90) 256)) (not (= .cse90 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse90 |c_ULTIMATE.start_gcd_test_~a#1|)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|))))) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_25|) .cse89))))))) (and .cse0 .cse1 .cse8 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse95 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse96 (mod .cse95 256))) (let ((.cse93 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| (+ (- 256) .cse96)))) (let ((.cse94 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse93))) (and (= (mod (+ (* .cse93 255) .cse94) 256) .cse2) (not (= .cse94 0)) (<= 128 (mod (+ (* 255 .cse95) .cse93) 256)) (<= 128 .cse96) (not (= .cse93 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (= (mod .cse93 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_25|) .cse96))))))))) .cse13)))) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2024-11-13 16:06:45,592 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (let ((.cse1 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) (.cse21 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse22 (<= (mod |c_ULTIMATE.start_gcd_test_~a#1| 256) 127)) (.cse11 (* |c_ULTIMATE.start_gcd_test_~a#1| 255)) (.cse12 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse5 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse4 (mod (+ .cse1 .cse3) 256))) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse4))) (let ((.cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse2))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse0 |c_ULTIMATE.start_gcd_test_~a#1|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= (mod (+ .cse1 .cse2 .cse3) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_25|) (<= |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4) (not (= .cse3 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= .cse4 127) (not (= .cse0 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse2 .cse0)))))))) .cse5) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse8 (mod .cse6 256))) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| (+ (- 256) .cse8)))) (let ((.cse9 (+ (mod (+ (* .cse7 255) (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse7)) 256) (- 256)))) (let ((.cse10 (mod .cse9 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (mod (+ (* 255 .cse6) .cse7) 256) 127) (<= 128 .cse8) (= (mod .cse7 .cse9) |c_ULTIMATE.start_gcd_test_~a#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (= (mod (+ .cse10 .cse11) 256) .cse12) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse10 0)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_25|) .cse8)))))))) .cse5) (and .cse5 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse14 (mod (+ .cse1 .cse16) 256))) (let ((.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse14))) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse15))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse13 |c_ULTIMATE.start_gcd_test_~a#1|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_25|) (<= |v_ULTIMATE.start_gcd_test_~a#1_25| .cse14) (<= 128 (mod (+ .cse1 .cse15 .cse16) 256)) (not (= .cse16 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= .cse14 127) (not (= .cse13 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse15 .cse13))))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse20 (mod .cse19 256))) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse20))) (let ((.cse17 (+ (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse18) (* 255 .cse18)) 256) (- 256)))) (and (= (mod .cse17 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= 128 (mod (+ .cse18 .cse19) 256)) (<= .cse20 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse18 .cse17)) (<= (mod .cse18 256) 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_25| 1) 0))))))) .cse21 .cse22) (and .cse5 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse26 (mod .cse25 256))) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse26))) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse23))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse23 .cse24)) (not (= .cse24 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_25|) (<= 128 (mod (+ .cse23 .cse25) 256)) (<= .cse26 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= |v_ULTIMATE.start_gcd_test_~a#1_25| .cse26) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse24 |c_ULTIMATE.start_gcd_test_~a#1|))))))))) (and .cse21 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse29 (mod .cse27 256))) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| (+ (- 256) .cse29)))) (let ((.cse30 (+ (mod (+ (* .cse28 255) (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse28)) 256) (- 256)))) (and (<= 128 (mod (+ (* 255 .cse27) .cse28) 256)) (<= 128 .cse29) (= (mod .cse30 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= (mod .cse28 .cse30) |c_ULTIMATE.start_gcd_test_~a#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_25|) .cse29))))))) .cse22) (and .cse5 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse34 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse35 (mod (+ .cse1 .cse34) 256))) (let ((.cse32 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| (+ (- 256) .cse35)))) (let ((.cse33 (+ (- 256) (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse32) (* 255 .cse32)) 256)))) (let ((.cse31 (mod .cse33 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (= (mod (+ .cse11 .cse31) 256) .cse12) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse32 .cse33)) (not (= .cse34 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 .cse35) (<= (mod (+ (* 255 .cse34) |c_ULTIMATE.start_main1_~y~0#1| .cse32) 256) 127) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_25|) .cse35) (not (= .cse31 0)))))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse37 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse38 (mod (+ .cse1 .cse37) 256))) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse38))) (let ((.cse39 (+ (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse36) (* 255 .cse36)) 256) (- 256)))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= 128 (mod (+ .cse1 .cse36 .cse37) 256)) (not (= .cse37 0)) (<= (mod .cse36 256) 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= .cse38 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_25| 1) 0) (= (mod .cse39 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= (mod .cse36 .cse39) |c_ULTIMATE.start_gcd_test_~a#1|))))))) .cse21 .cse22) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse43 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse44 (mod (+ .cse1 .cse43) 256))) (let ((.cse41 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| (+ (- 256) .cse44)))) (let ((.cse42 (+ (- 256) (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse41) (* 255 .cse41)) 256)))) (let ((.cse40 (mod .cse42 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (= (mod (+ .cse11 .cse40) 256) .cse12) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse41 .cse42)) (<= 128 (mod (+ (* 255 .cse43) |c_ULTIMATE.start_main1_~y~0#1| .cse41) 256)) (not (= .cse43 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 .cse44) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_25|) .cse44) (not (= .cse40 0))))))))) .cse5) (and .cse5 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse47 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse48 (mod .cse47 256))) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse48))) (let ((.cse46 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse45))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse45 .cse46)) (<= (mod (+ .cse45 .cse47) 256) 127) (not (= .cse46 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_25|) (<= .cse48 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= |v_ULTIMATE.start_gcd_test_~a#1_25| .cse48) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse46 |c_ULTIMATE.start_gcd_test_~a#1|))))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse50 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse51 (mod .cse50 256))) (let ((.cse49 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse51))) (let ((.cse53 (+ (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse49) (* 255 .cse49)) 256) (- 256)))) (let ((.cse52 (mod .cse53 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= 128 (mod (+ .cse49 .cse50) 256)) (<= .cse51 127) (= .cse12 (mod (+ .cse52 .cse11) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse49 .cse53)) (<= (mod .cse49 256) 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_25| 1) 0) (not (= .cse52 0))))))))) .cse5) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse54 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse56 (mod .cse54 256))) (let ((.cse55 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| (+ (- 256) .cse56)))) (let ((.cse57 (+ (mod (+ (* .cse55 255) (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse55)) 256) (- 256)))) (and (<= (mod (+ (* 255 .cse54) .cse55) 256) 127) (<= 128 .cse56) (= (mod .cse57 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= (mod .cse55 .cse57) |c_ULTIMATE.start_gcd_test_~a#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_25|) .cse56))))))) .cse21 .cse22) (and .cse5 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse60 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse61 (mod (+ .cse1 .cse60) 256))) (let ((.cse59 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse61))) (let ((.cse62 (+ (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse59) (* 255 .cse59)) 256) (- 256)))) (let ((.cse58 (mod .cse62 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (= (mod (+ .cse11 .cse58) 256) .cse12) (<= 128 (mod (+ .cse1 .cse59 .cse60) 256)) (not (= .cse60 0)) (<= (mod .cse59 256) 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse58 0)) (<= .cse61 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_25| 1) 0) (= (mod .cse59 .cse62) |c_ULTIMATE.start_gcd_test_~a#1|))))))))) (and .cse5 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse64 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse65 (mod .cse64 256))) (let ((.cse63 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse65))) (let ((.cse67 (+ (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse63) (* 255 .cse63)) 256) (- 256)))) (let ((.cse66 (mod .cse67 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (mod (+ .cse63 .cse64) 256) 127) (<= .cse65 127) (= .cse12 (mod (+ .cse66 .cse11) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse63 .cse67)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_25| 1) 0) (not (= .cse66 0)) (not (= .cse65 0)))))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse69 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse70 (mod (+ .cse1 .cse69) 256))) (let ((.cse68 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse70))) (let ((.cse72 (+ (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse68) (* 255 .cse68)) 256) (- 256)))) (let ((.cse71 (mod .cse72 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= (mod (+ .cse1 .cse68 .cse69) 256) 127) (not (= .cse70 0)) (= (mod (+ .cse11 .cse71) 256) .cse12) (not (= .cse69 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse71 0)) (<= .cse70 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_25| 1) 0) (= (mod .cse68 .cse72) |c_ULTIMATE.start_gcd_test_~a#1|)))))))) .cse5) (and .cse21 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse75 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse76 (mod (+ .cse1 .cse75) 256))) (let ((.cse73 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| (+ (- 256) .cse76)))) (let ((.cse74 (+ (- 256) (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse73) (* 255 .cse73)) 256)))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse73 .cse74)) (= (mod .cse74 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse75 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 .cse76) (<= (mod (+ (* 255 .cse75) |c_ULTIMATE.start_main1_~y~0#1| .cse73) 256) 127) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_25|) .cse76))))))) .cse22) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse79 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse80 (mod (+ .cse1 .cse79) 256))) (let ((.cse77 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| (+ (- 256) .cse80)))) (let ((.cse78 (+ (- 256) (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse77) (* 255 .cse77)) 256)))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse77 .cse78)) (<= 128 (mod (+ (* 255 .cse79) |c_ULTIMATE.start_main1_~y~0#1| .cse77) 256)) (= (mod .cse78 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse79 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 .cse80) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_25|) .cse80))))))) .cse21 .cse22) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse82 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse83 (mod (+ .cse1 .cse82) 256))) (let ((.cse81 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse83))) (let ((.cse84 (+ (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse81) (* 255 .cse81)) 256) (- 256)))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= (mod (+ .cse1 .cse81 .cse82) 256) 127) (not (= .cse83 0)) (not (= .cse82 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= .cse83 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_25| 1) 0) (= (mod .cse84 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= (mod .cse81 .cse84) |c_ULTIMATE.start_gcd_test_~a#1|))))))) .cse21 .cse22) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse86 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse88 (mod .cse86 256))) (let ((.cse85 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse88))) (let ((.cse87 (+ (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse85) (* 255 .cse85)) 256) (- 256)))) (and (<= (mod (+ .cse85 .cse86) 256) 127) (= (mod .cse87 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= .cse88 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse85 .cse87)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_25| 1) 0) (not (= .cse88 0)))))))) .cse21 .cse22) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse89 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse91 (mod .cse89 256))) (let ((.cse90 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| (+ (- 256) .cse91)))) (let ((.cse92 (+ (mod (+ (* .cse90 255) (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse90)) 256) (- 256)))) (let ((.cse93 (mod .cse92 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= 128 (mod (+ (* 255 .cse89) .cse90) 256)) (<= 128 .cse91) (= (mod .cse90 .cse92) |c_ULTIMATE.start_gcd_test_~a#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (= (mod (+ .cse93 .cse11) 256) .cse12) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse93 0)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_25|) .cse91)))))))) .cse5)))) is different from false [2024-11-13 16:06:58,311 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-13 16:06:58,311 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-11-13 16:06:58,312 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-13 16:06:58,318 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 16:06:58,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:06:58,517 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_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") 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.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:294) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:590) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:728) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.pushInner(QuantifierPusher.java:274) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:194) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:290) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) 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.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) ... 65 more [2024-11-13 16:06:58,522 INFO L158 Benchmark]: Toolchain (without parser) took 438989.87ms. Allocated memory was 117.4MB in the beginning and 327.2MB in the end (delta: 209.7MB). Free memory was 94.7MB in the beginning and 121.6MB in the end (delta: -26.9MB). Peak memory consumption was 193.0MB. Max. memory is 16.1GB. [2024-11-13 16:06:58,522 INFO L158 Benchmark]: CDTParser took 1.50ms. Allocated memory is still 142.6MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:06:58,522 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.03ms. Allocated memory is still 117.4MB. Free memory was 94.7MB in the beginning and 82.8MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:06:58,523 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.00ms. Allocated memory is still 117.4MB. Free memory was 82.8MB in the beginning and 81.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:06:58,523 INFO L158 Benchmark]: Boogie Preprocessor took 64.93ms. Allocated memory is still 117.4MB. Free memory was 81.1MB in the beginning and 79.6MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:06:58,523 INFO L158 Benchmark]: RCFGBuilder took 420.95ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 65.8MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:06:58,524 INFO L158 Benchmark]: TraceAbstraction took 438088.99ms. Allocated memory was 117.4MB in the beginning and 327.2MB in the end (delta: 209.7MB). Free memory was 65.3MB in the beginning and 121.6MB in the end (delta: -56.3MB). Peak memory consumption was 167.9MB. Max. memory is 16.1GB. [2024-11-13 16:06:58,526 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.50ms. Allocated memory is still 142.6MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.03ms. Allocated memory is still 117.4MB. Free memory was 94.7MB in the beginning and 82.8MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.00ms. Allocated memory is still 117.4MB. Free memory was 82.8MB in the beginning and 81.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 64.93ms. Allocated memory is still 117.4MB. Free memory was 81.1MB in the beginning and 79.6MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 420.95ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 65.8MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 438088.99ms. Allocated memory was 117.4MB in the beginning and 327.2MB in the end (delta: 209.7MB). Free memory was 65.3MB in the beginning and 121.6MB in the end (delta: -56.3MB). Peak memory consumption was 167.9MB. 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_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : 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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_2_3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f6c5808fcdfedd93e514ea4bc51242b78bf5dcc9e332c7faf3dfcc4d6de127e2 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 16:07:01,152 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:07:01,293 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 16:07:01,300 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:07:01,300 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 16:07:01,326 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:07:01,326 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 16:07:01,327 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 16:07:01,327 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 16:07:01,327 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 16:07:01,327 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 16:07:01,328 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 16:07:01,328 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:07:01,328 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:07:01,328 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 16:07:01,329 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:07:01,329 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 16:07:01,329 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 16:07:01,329 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 16:07:01,329 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:07:01,330 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 16:07:01,330 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 16:07:01,330 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 16:07:01,330 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 16:07:01,330 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 16:07:01,330 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:07:01,331 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 16:07:01,331 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 16:07:01,331 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 16:07:01,331 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:07:01,331 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:07:01,331 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 16:07:01,332 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 16:07:01,332 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 16:07:01,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:07:01,332 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:07:01,332 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 16:07:01,332 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 16:07:01,333 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 16:07:01,333 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 16:07:01,333 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 16:07:01,333 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 16:07:01,333 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 16:07:01,333 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 16:07:01,333 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f6c5808fcdfedd93e514ea4bc51242b78bf5dcc9e332c7faf3dfcc4d6de127e2 [2024-11-13 16:07:01,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:07:01,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:07:01,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:07:01,694 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:07:01,695 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:07:01,696 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/combinations/gcd_2+newton_2_3.i Unable to find full path for "g++" [2024-11-13 16:07:03,623 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:07:03,887 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:07:03,888 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/sv-benchmarks/c/combinations/gcd_2+newton_2_3.i [2024-11-13 16:07:03,896 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/data/534fd1f61/084d265dfa6c4169b678b29b1efaf02e/FLAGebc28396f [2024-11-13 16:07:03,914 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/data/534fd1f61/084d265dfa6c4169b678b29b1efaf02e [2024-11-13 16:07:03,916 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:07:03,919 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:07:03,920 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:07:03,920 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:07:03,926 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:07:03,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:07:03" (1/1) ... [2024-11-13 16:07:03,928 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b41a7e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:07:03, skipping insertion in model container [2024-11-13 16:07:03,928 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:07:03" (1/1) ... [2024-11-13 16:07:03,945 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:07:04,098 WARN L250 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_64499b9c-721d-43d0-9709-eb9f21574abf/sv-benchmarks/c/combinations/gcd_2+newton_2_3.i[1226,1239] [2024-11-13 16:07:04,144 WARN L250 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_64499b9c-721d-43d0-9709-eb9f21574abf/sv-benchmarks/c/combinations/gcd_2+newton_2_3.i[2841,2854] [2024-11-13 16:07:04,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:07:04,172 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:07:04,189 WARN L250 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_64499b9c-721d-43d0-9709-eb9f21574abf/sv-benchmarks/c/combinations/gcd_2+newton_2_3.i[1226,1239] [2024-11-13 16:07:04,212 WARN L250 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_64499b9c-721d-43d0-9709-eb9f21574abf/sv-benchmarks/c/combinations/gcd_2+newton_2_3.i[2841,2854] [2024-11-13 16:07:04,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:07:04,240 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:07:04,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:07:04 WrapperNode [2024-11-13 16:07:04,241 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:07:04,242 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:07:04,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:07:04,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:07:04,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:07:04" (1/1) ... [2024-11-13 16:07:04,271 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:07:04" (1/1) ... [2024-11-13 16:07:04,297 INFO L138 Inliner]: procedures = 28, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 80 [2024-11-13 16:07:04,300 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:07:04,301 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:07:04,301 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:07:04,301 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:07:04,311 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:07:04" (1/1) ... [2024-11-13 16:07:04,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:07:04" (1/1) ... [2024-11-13 16:07:04,315 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:07:04" (1/1) ... [2024-11-13 16:07:04,343 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-13 16:07:04,343 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:07:04" (1/1) ... [2024-11-13 16:07:04,344 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:07:04" (1/1) ... [2024-11-13 16:07:04,356 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:07:04" (1/1) ... [2024-11-13 16:07:04,365 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:07:04" (1/1) ... [2024-11-13 16:07:04,368 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:07:04" (1/1) ... [2024-11-13 16:07:04,373 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:07:04" (1/1) ... [2024-11-13 16:07:04,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:07:04,381 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:07:04,381 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:07:04,381 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:07:04,382 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:07:04" (1/1) ... [2024-11-13 16:07:04,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:07:04,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:07:04,433 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 16:07:04,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 16:07:04,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:07:04,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 16:07:04,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-13 16:07:04,466 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-13 16:07:04,466 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-13 16:07:04,467 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-13 16:07:04,467 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-13 16:07:04,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:07:04,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:07:04,572 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:07:04,574 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:07:16,705 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-13 16:07:16,705 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:07:16,717 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:07:16,717 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 16:07:16,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:07:16 BoogieIcfgContainer [2024-11-13 16:07:16,718 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:07:16,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 16:07:16,721 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 16:07:16,726 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 16:07:16,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 04:07:03" (1/3) ... [2024-11-13 16:07:16,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a114709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:07:16, skipping insertion in model container [2024-11-13 16:07:16,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:07:04" (2/3) ... [2024-11-13 16:07:16,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a114709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:07:16, skipping insertion in model container [2024-11-13 16:07:16,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:07:16" (3/3) ... [2024-11-13 16:07:16,729 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_3.i [2024-11-13 16:07:16,745 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 16:07:16,747 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG gcd_2+newton_2_3.i that has 3 procedures, 37 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2024-11-13 16:07:16,809 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 16:07:16,822 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5c49e193, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 16:07:16,822 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 16:07:16,826 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 16:07:16,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 16:07:16,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:07:16,833 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:07:16,833 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:07:16,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:07:16,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1738968779, now seen corresponding path program 1 times [2024-11-13 16:07:16,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:07:16,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1965316782] [2024-11-13 16:07:16,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:07:16,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:07:16,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:07:16,854 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:07:16,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 16:07:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:16,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 16:07:16,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:07:17,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:07:17,192 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:07:17,193 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:07:17,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965316782] [2024-11-13 16:07:17,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965316782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:07:17,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:07:17,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 16:07:17,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340210736] [2024-11-13 16:07:17,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:07:17,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:07:17,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:07:17,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:07:17,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:07:17,226 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:07:17,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:07:17,471 INFO L93 Difference]: Finished difference Result 72 states and 91 transitions. [2024-11-13 16:07:17,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 16:07:17,474 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 [2024-11-13 16:07:17,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:07:17,481 INFO L225 Difference]: With dead ends: 72 [2024-11-13 16:07:17,482 INFO L226 Difference]: Without dead ends: 30 [2024-11-13 16:07:17,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:07:17,490 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:07:17,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 107 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 16:07:17,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-13 16:07:17,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2024-11-13 16:07:17,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 16:07:17,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2024-11-13 16:07:17,556 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 11 [2024-11-13 16:07:17,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:07:17,557 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2024-11-13 16:07:17,557 INFO L472 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) [2024-11-13 16:07:17,557 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2024-11-13 16:07:17,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 16:07:17,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:07:17,559 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:07:17,580 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 16:07:17,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:07:17,763 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:07:17,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:07:17,764 INFO L85 PathProgramCache]: Analyzing trace with hash 36038583, now seen corresponding path program 1 times [2024-11-13 16:07:17,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:07:17,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [995040058] [2024-11-13 16:07:17,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:07:17,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:07:17,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:07:17,767 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:07:17,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 16:07:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:17,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 16:07:17,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:07:18,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:07:18,035 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:07:18,035 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:07:18,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995040058] [2024-11-13 16:07:18,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995040058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:07:18,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:07:18,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 16:07:18,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735058724] [2024-11-13 16:07:18,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:07:18,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:07:18,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:07:18,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:07:18,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:07:18,039 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:07:18,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:07:18,182 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2024-11-13 16:07:18,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 16:07:18,183 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 [2024-11-13 16:07:18,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:07:18,184 INFO L225 Difference]: With dead ends: 36 [2024-11-13 16:07:18,184 INFO L226 Difference]: Without dead ends: 30 [2024-11-13 16:07:18,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:07:18,186 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:07:18,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 81 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:07:18,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-13 16:07:18,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-13 16:07:18,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 16:07:18,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-11-13 16:07:18,197 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2024-11-13 16:07:18,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:07:18,197 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-11-13 16:07:18,198 INFO L472 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) [2024-11-13 16:07:18,198 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-11-13 16:07:18,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 16:07:18,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:07:18,199 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:07:18,218 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 16:07:18,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:07:18,400 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:07:18,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:07:18,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1576478087, now seen corresponding path program 1 times [2024-11-13 16:07:18,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:07:18,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [574262194] [2024-11-13 16:07:18,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:07:18,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:07:18,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:07:18,408 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:07:18,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 16:07:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:18,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 16:07:18,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:07:19,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:07:19,334 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:07:20,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:07:20,460 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:07:20,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574262194] [2024-11-13 16:07:20,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574262194] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:07:20,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:07:20,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2024-11-13 16:07:20,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816415135] [2024-11-13 16:07:20,460 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:07:20,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 16:07:20,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:07:20,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 16:07:20,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-13 16:07:20,462 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 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) [2024-11-13 16:07:21,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:07:21,987 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2024-11-13 16:07:21,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 16:07:21,988 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 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 [2024-11-13 16:07:21,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:07:21,989 INFO L225 Difference]: With dead ends: 34 [2024-11-13 16:07:21,989 INFO L226 Difference]: Without dead ends: 20 [2024-11-13 16:07:21,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-11-13 16:07:21,991 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:07:21,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 227 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-13 16:07:21,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-13 16:07:21,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-13 16:07:21,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.0) internal successors, (13), 13 states have internal predecessors, (13), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 16:07:21,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2024-11-13 16:07:21,996 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 12 [2024-11-13 16:07:21,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:07:21,997 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2024-11-13 16:07:21,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 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) [2024-11-13 16:07:21,997 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2024-11-13 16:07:21,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 16:07:21,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:07:21,998 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:07:22,015 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 16:07:22,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:07:22,199 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:07:22,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:07:22,199 INFO L85 PathProgramCache]: Analyzing trace with hash -17555527, now seen corresponding path program 1 times [2024-11-13 16:07:22,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:07:22,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1132345742] [2024-11-13 16:07:22,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:07:22,200 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 [2024-11-13 16:07:22,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:07:22,204 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/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) [2024-11-13 16:07:22,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64499b9c-721d-43d0-9709-eb9f21574abf/bin/uautomizer-verify-qhAvR1uOyd/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